The degree-diameter problem for circulant graphs of degree 8 and 9

zbMath1305.05107arXiv1404.3948MaRDI QIDQ490264

Robert R. Lewis

Publication date: 22 January 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

circulant graphs; extremal; abelian Cayley graphs; degree-diameter

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C12: Distance in graphs

Related Items

Unnamed Item, Unnamed Item, On the non-existence of Abelian Moore Cayley graphs with excess one, NEW FAMILIES OF MULTIPLICATIVE CIRCULANT NETWORKS, Unnamed Item, Parallel optimization and performance tuning on a Kunpeng cluster of genetic algorithm for synthesis of circulant networks, Searching for large multi-loop networks, The degree-diameter problem for circulant graphs of degrees 10 and 11, Efficient eight-regular circulants based on the Kronecker product, Greedy routing in circulant networks

Cites Work

• Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
• Tilings in Lee metric
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• Undirected loop networks
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• Note on a “Square” Functional Equation