On large vertex-symmetric digraphs

DOI10.1016/J.DISC.2008.01.045zbMath1225.05112OpenAlexW1971804349MaRDI QIDQ1024427

J. Martínez

Publication date: 17 June 2009

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

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

zbMATH Keywords

graphlarge digraphvertex-symmetric digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Communication theory (94A05)

Related Items (3)

Revisiting the Comellas-Fiol-Gómez constructions of large digraphs of given degree and diameter ⋮ Which Faber-Moore-Chen digraphs are Cayley digraphs? ⋮ Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the impossibility of directed Moore graphs
• Vertex-symmetric digraphs with small diameter
• Moore graphs and beyond: a survey of the degree/diameter problem
• Cycle prefix digraphs for symmetric interconnection networks
• Line Digraph Iterations and the (d, k) Digraph Problem
• Message Graphs
• Large vertex symmetric digraphs

This page was built for publication: On large vertex-symmetric digraphs