Optimal graphs in the enhanced mesh networks

DOI10.1155/2020/9869201zbMath1448.05067OpenAlexW3087955109MaRDI QIDQ780519

Muhammad Shahzad Akhtar, Muhammad Imran, Syed Ahtsham ul Haq Bokhary

Publication date: 15 July 2020

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/9869201

zbMATH Keywords

degree diameter problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of topological indices of certain networks
• The maximum degree and diameter-bounded subgraph in the mesh
• Degree diameter problem on honeycomb networks
• Valency-based topological descriptors and structural property of the generalized Sierpiński networks
• On the game chromatic number of splitting graphs of path and cycle
• The maximum degree \& diameter-bounded subgraph and its applications
• A family of graphs and the degree/diameter problem
• THE HOSOYA INDEX OF GRAPHS FORMED BY A FRACTAL GRAPH

This page was built for publication: Optimal graphs in the enhanced mesh networks