A Moore-like bound for mixed abelian Cayley graphs

DOI10.1016/J.ENDM.2016.09.026zbMATH Open1356.05070OpenAlexW2539110220WikidataQ60692180 ScholiaQ60692180MaRDI QIDQ510563FDOQ510563

Authors Nacho López, Hebert Pérez-Rosés, 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

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

Recommendations

• 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
• Approaching the mixed Moore bound for diameter two by Cayley graphs
• Moore mixed graphs from Cayley graphs
• Mixed Moore Cayley graphs
• A revised Moore bound for mixed graphs
• Bounding neighbor-connectivity of Abelian Cayley graphs
• Approaching the Moore bound for diameter two by Cayley graphs
• A new bound for neighbor-connectivity of abelian Cayley graphs
• A proof of the Meyniel conjecture for abelian Cayley graphs

Cites work

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

Cited in

(5)

• On the non-existence of Abelian Moore Cayley graphs with excess one
• A note on Moore Cayley digraphs
• New Moore-like bounds and some optimal families of abelian Cayley mixed graphs
• Bounding neighbor-connectivity of Abelian Cayley graphs
• An improved Moore bound and some new optimal families of mixed abelian Cayley graphs

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

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