Optimal Graphs in the Enhanced Mesh Networks
Joint Authors
Imran, Muhammad
Shahzad Akhtar, Muhammad
Bokhary, Syed Ahtsham ul Haq
Source
Issue
Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-15, 15 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2020-05-01
Country of Publication
Egypt
No. of Pages
15
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Shahzad Akhtar, Muhammad& Imran, Muhammad& Bokhary, Syed Ahtsham ul Haq. 2020. Optimal Graphs in the Enhanced Mesh Networks. Journal of Mathematics،Vol. 2020, no. 2020, pp.1-15.
https://search.emarefa.net/detail/BIM-1188291
Modern Language Association (MLA)
Shahzad Akhtar, Muhammad…[et al.]. Optimal Graphs in the Enhanced Mesh Networks. Journal of Mathematics No. 2020 (2020), pp.1-15.
https://search.emarefa.net/detail/BIM-1188291
American Medical Association (AMA)
Shahzad Akhtar, Muhammad& Imran, Muhammad& Bokhary, Syed Ahtsham ul Haq. Optimal Graphs in the Enhanced Mesh Networks. Journal of Mathematics. 2020. Vol. 2020, no. 2020, pp.1-15.
https://search.emarefa.net/detail/BIM-1188291
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1188291
