Complete characterization of almost Moore digraphs of degree three
From MaRDI portal
Recommendations
Cited in
(20)- Digraphs of degree 3 and order close to the moore bound
- On diregular digraphs with degree two and excess three
- Enumerations of vertex orders of almost Moore digraphs with selfrepeats
- 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 weak distance-regularity of Moore-type digraphs
- On the nonexistence of almost Moore digraphs of degree four and five
- Divisibility conditions in almost Moore digraphs with selfrepeats
- On the nonexistence of almost Moore digraphs
- On the nonexistence of almost Moore digraphs with self-repeats
- Nonexistence of almost Moore digraphs of diameter three
- On the existence of almost Moore digraphs of diameter three
- Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism
- 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 impossibility of certain Moore graphs
- Digraphs with degree two and excess two are diregular
- New results regarding the permutation cycle structure of almost Moore digraphs
- On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices
This page was built for publication: Complete characterization of almost Moore digraphs of degree three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667792)
