On the existence of \((d,k)\)-digraphs

DOI10.1016/S0012-365X(99)90087-0zbMath0927.05035OpenAlexW4210749045MaRDI QIDQ1292845

Joan Gimbert

Publication date: 5 December 1999

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90087-0

zbMATH Keywords

digraphspectrumdiameterdegreealmost Moore digraphMoore bound

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Multipartite Moore digraphs ⋮ On mixed Moore graphs ⋮ On digraphs of excess one ⋮ Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats ⋮ On the nonexistence of almost Moore digraphs ⋮ Enumerations of vertex orders of almost Moore digraphs with selfrepeats ⋮ On diregular digraphs with degree two and excess three ⋮ On the nonexistence of almost Moore digraphs of degree four and five

Cites Work

• On the impossibility of directed Moore graphs
• On the structure of digraphs with order close to the Moore bound
• Line Digraph Iterations and the (d, k) Digraph Problem
• Minimum Diameter of Diregular Digraphs of Degree 2
• Digraphs of degree 3 and order close to the moore bound
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the existence of \((d,k)\)-digraphs