Tables of large graphs with given degree and diameter

DOI10.1016/0020-0190(82)90076-XzbMath0485.94030OpenAlexW2077534920MaRDI QIDQ1164611

Jean-Jacques Quisquater, Jean-Claude Bermond, Charles Delorme

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90076-x

zbMATH Keywords

interconnection networkscomputer networksnetwork architectures

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Enumeration in graph theory (05C30) Applications of graph theory to circuits and networks (94C15)

Related Items (4)

Sufficient conditions for maximally connected dense graphs ⋮ Cayley graphs as models of deterministic small-world networks ⋮ Large graphs with given degree and diameter. II ⋮ Permutation Factorization on Star-Connected Networks of Binary Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large graphs with given degree and diameter. II
• High density graphs for processor interconnection
• On order in generalized polygons
• Directed graphs with unique paths of fixed length
• On some solutions of \(A^k=dI+\lambda J\)
• Advances in graph theory
• The diameter of random regular graphs
• Affine representations of generalized quadrangles
• Grands Graphes De Degré Et Diamètre Fixés
• Large Graphs with Given Degree and Diameter—Part I
• Design to Minimize Diameter on Building-Block Network
• Large Graphs with Given Degree and Diameter III
• Some New Results About the (d, k) Graph Problem
• Minimal Regular Graphs of Girths Eight and Twelve
• Improved Construction Techniques for (d, k) Graphs

This page was built for publication: Tables of large graphs with given degree and diameter