Which Faber-Moore-Chen digraphs are Cayley digraphs?

DOI10.1016/j.disc.2010.04.020zbMath1220.05052OpenAlexW36826017MaRDI QIDQ708363

Mária Ždímalová, Ľubica Staneková

Publication date: 11 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.04.020

zbMATH Keywords

digraphCayley digraphdegree-diameter problem

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Large Cayley digraphs and bipartite Cayley digraphs of odd diameters ⋮ Large Cayley digraphs of given degree and diameter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On large vertex-symmetric digraphs
• Fault-tolerant routing in circulant networks and cycle prefix networks
• Broadcasting in cycle prefix digraphs
• Vertex-symmetric digraphs with small diameter
• Moore graphs and beyond: a survey of the degree/diameter problem
• Cycle prefix digraphs for symmetric interconnection networks
• On a Class of Fixed-Point-Free Graphs
• Large vertex symmetric digraphs

This page was built for publication: Which Faber-Moore-Chen digraphs are Cayley digraphs?