The Problem of a Symmetric Graph with a Maximum Number of Vertices and Minimum Diameter

DOI10.1134/S1995080223120351MaRDI QIDQ6497314

Unnamed Author, Andrei M. Sukhov, A. Y. Romanov

Publication date: 6 May 2024

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Distance in graphs (05C12) Distributed systems (68M14)

Cites Work

• Optimal routing in double loop networks
• Greedy routing in circulant networks
• A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
• The Chip Is the Network: Toward a Science of Network-on-Chip Design

This page was built for publication: The Problem of a Symmetric Graph with a Maximum Number of Vertices and Minimum Diameter