Revisiting the Comellas-Fiol-Gómez constructions of large digraphs of given degree and diameter

DOI10.1016/J.DISC.2009.06.002zbMath1221.05185OpenAlexW2171821205MaRDI QIDQ968411

Mária Ždímalová

Publication date: 5 May 2010

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

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

zbMATH Keywords

liftdigraphdiameterdegreevoltage assignment

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Improved lower bounds on the degree-diameter problem

Cites Work

• On large vertex-symmetric digraphs
• Vertex-symmetric digraphs with small diameter
• Moore graphs and beyond: a survey of the degree/diameter problem
• Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
• Cycle prefix digraphs for symmetric interconnection networks
• Large vertex symmetric digraphs

This page was built for publication: Revisiting the Comellas-Fiol-Gómez constructions of large digraphs of given degree and diameter