New results for the degree/diameter problem

DOI10.1002/net.3230240702zbMath0806.05039arXivmath/9504214OpenAlexW1985421025WikidataQ57535790 ScholiaQ57535790MaRDI QIDQ4313626

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

semidirect productsdiameterCayley graphsdegreecyclic groupscommunication networklarge graphscomputer searches

Mathematics Subject Classification ID

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

Related Items (9)

Degree- and time-constrained broadcast networks ⋮ Graphs of order two less than the Moore bound ⋮ Some new large (Δ, 3)‐graphs ⋮ Vertex-symmetric digraphs with small diameter ⋮ A note on large graphs of diameter two and given maximum degree ⋮ A note on the McKay-Miller-Širáň graphs ⋮ A note on large Cayley graphs of diameter two and given degree ⋮ Largest Graphs of Diameter 2 and Maximum Degree 6 ⋮ Some new large compound graphs

Cites Work

• Algebraic Graph Theory
• Unnamed Item

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