New results for the degree/diameter problem

DOI10.1002/NET.3230240702MaRDI QIDQ4313626zbMATH OpenOpenAlexWikidataFDO

Authors Michael J. Dinneen, Paul R. Hafner

Publication date 27 November 1994

Published in Networks (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9504214

zbMATH Keywords

Cayley graphsdiametercommunication networkdegreesemidirect productslarge graphscyclic groupscomputer searches

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Communication networks in operations research (90B18)

Abstract: The results of computer searches for large graphs with given (small) degree and diameter are presented. The new graphs are Cayley graphs of semidirect products of cyclic groups and related groups. One fundamental use of our ``dense graphs is in the design of efficient communication network topologies.

Recommendations

• scientific article; zbMATH DE number 5309966
• scientific article; zbMATH DE number 784887
• Dense group networks
• scientific article; zbMATH DE number 1107739
• Cayley graphs of given degree and diameters 3, 4 and 5

Cites work

• Algebraic Graph Theory
• Graph theory with applications

Cited in

(14)

• The Design of Small-Diameter Networks by Local Search
• A note on the McKay-Miller-Širáň graphs
• scientific article; zbMATH DE number 3950393 (Why is no real title available?)
• Searching for large multi-loop networks
• scientific article; zbMATH DE number 177869 (Why is no real title available?)
• A note on large graphs of diameter two and given maximum degree
• Largest Graphs of Diameter 2 and Maximum Degree 6
• Degree- and time-constrained broadcast networks
• Vertex-symmetric digraphs with small diameter
• Dense group networks
• Some new large (Δ, 3)‐graphs
• Graphs of order two less than the Moore bound
• A note on large Cayley graphs of diameter two and given degree
• Some new large compound graphs

This page was built for publication: New results for the degree/diameter problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4313626)