Complete characterization of almost Moore digraphs of degree three

DOI10.1002/jgt.20042zbMath1060.05036OpenAlexW4238018138MaRDI QIDQ4667792

Jozef Širáň, Mirka Miller, Martin Sutton, Edy Tri Baskoro

Publication date: 21 April 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20042

zbMATH Keywords

digraphsMoore bounddegree/diameter problem

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

Eulogy for Professor Mirka Miller (1949--2016) ⋮ 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 ⋮ On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices ⋮ Digraphs with degree two and excess two are diregular ⋮ Enumerations of vertex orders of almost Moore digraphs with selfrepeats ⋮ On diregular digraphs with degree two and excess three ⋮ On total regularity of mixed graphs with order close to the Moore bound ⋮ Distances of centroid sets in a graph-based construction for information security applications ⋮ On the nonexistence of almost Moore digraphs of degree four and five ⋮ On the weak distance-regularity of Moore-type digraphs ⋮ Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism ⋮ Divisibility conditions in almost Moore digraphs with selfrepeats

This page was built for publication: Complete characterization of almost Moore digraphs of degree three