Vertex-symmetric digraphs with small diameter

DOI10.1016/0166-218X(93)E0145-OzbMath0822.05033OpenAlexW4210553238WikidataQ57772709 ScholiaQ57772709MaRDI QIDQ1805459

Miquel Àngel Fiol, Francesc Comellas

Publication date: 19 June 1995

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

Full work available at URL: https://doi.org/10.1016/0166-218x(93)e0145-o

zbMATH Keywords

diameterout-degreedigraphs on alphabetslarge vertex-symmetric digraphsvertex symmetry

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items

On the Day-Tripathi orientation of the star graphs: connectivity ⋮ Digraphs on permutations ⋮ Spectra and eigenspaces from regular partitions of Cayley (di)graphs of permutation groups ⋮ Broadcasting in cycle prefix digraphs ⋮ Uni-directional alternating group graphs ⋮ Weakly distance-regular digraphs. ⋮ Orienting Cayley graphs generated by transposition trees ⋮ Unnamed Item ⋮ 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 ⋮ Strong structural properties of unidirectional star graphs ⋮ On large vertex-symmetric digraphs ⋮ Unnamed Item ⋮ A new general family of mixed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the impossibility of directed Moore graphs
• Determining the Hamilton-connectedness of certain vertex-transitive graphs
• Line Digraph Iterations and the (d, k) Digraph Problem
• Message Graphs
• New results for the degree/diameter problem