IDEAS home Printed from https://ideas.repec.org/a/hin/jjmath/9869201.html
   My bibliography  Save this article

Optimal Graphs in the Enhanced Mesh Networks

Author

Listed:
  • Muhammad Shahzad Akhtar
  • Muhammad Imran
  • Syed Ahtsham ul Haq Bokhary
  • Andrei V. Kelarev

Abstract

The degree diameter problem explores the biggest graph (in terms of number of nodes) subject to some restrictions on the valency and the diameter of the graph. The restriction on the valency of the graph does not impose any condition on the number of edges (apart from taking the graph simple), so the resulting graph may be thought of as being embedded in the complete graph. In a generality of the said problem, the graph is taken to be embedded in any connected host graph. In this article, host graph is considered as the enhanced mesh network constructed from the grid network. This article provides some exact values for the said problem and also gives some bounds for the optimal graphs.

Suggested Citation

  • Muhammad Shahzad Akhtar & Muhammad Imran & Syed Ahtsham ul Haq Bokhary & Andrei V. Kelarev, 2020. "Optimal Graphs in the Enhanced Mesh Networks," Journal of Mathematics, Hindawi, vol. 2020, pages 1-15, May.
    • Handle: RePEc:hin:jjmath:9869201
    DOI: 10.1155/2020/9869201
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jmath/2020/9869201.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/jmath/2020/9869201.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2020/9869201?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jjmath:9869201. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.