A Moore-like bound for mixed abelian Cayley graphs

DOI10.1016/J.ENDM.2016.09.026zbMath1356.05070OpenAlexW2539110220WikidataQ60692180 ScholiaQ60692180MaRDI QIDQ510563

Hebert Pérez-Rosés, Nacho López, Jordi Pujolàs

Publication date: 13 February 2017

Full work available at URL: http://hdl.handle.net/10459.1/58031

zbMATH Keywords

Cayley graphsmixed graphsdegree/diameter problem

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (2)

New Moore-like bounds and some optimal families of abelian Cayley mixed graphs ⋮ An improved Moore bound and some new optimal families of mixed abelian Cayley graphs

Cites Work

• A revised Moore bound for mixed graphs
• The maximum degree and diameter-bounded subgraph in the mesh
• Reliable circulant networks with minimum transmission delay
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case

This page was built for publication: A Moore-like bound for mixed abelian Cayley graphs