On the impossibility of directed Moore graphs
From MaRDI portal
Cites work
Cited in
(37)- On large vertex-symmetric digraphs
- Super edge-connectivity of dense digraphs and graphs
- An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph
- On the existence of \((d,k)\)-digraphs
- On digraphs of excess one
- On diregular digraphs with degree two and excess two
- On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices
- Digraphs with degree two and excess two are diregular
- Vertex-symmetric digraphs with small diameter
- Directed Moore hypergraphs
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. II
- On diregular digraphs with degree two and excess three
- A note on Moore Cayley digraphs
- On networks with order close to the Moore bound
- On total regularity of mixed graphs with order close to the Moore bound
- On the nonexistence of almost Moore digraphs
- Enumerations of vertex orders of almost Moore digraphs with selfrepeats
- On the nonexistence of almost Moore digraphs of degree four and five
- Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats
- On mixed almost Moore graphs of diameter two
- Miscellaneous digraph classes
- Properties of mixed Moore graphs of directed degree one
- Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism
- On the weak distance-regularity of Moore-type digraphs
- Switchings, extensions, and reductions in central digraphs
- The underlying line digraph structure of some (0, 1)-matrix equations
- On mixed radial Moore graphs of diameter 3
- Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
- New results regarding the permutation cycle structure of almost Moore digraphs
- On the nonexistence of almost Moore digraphs with self-repeats
- A family of mixed graphs with large order and diameter 2
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
- Multipartite Moore digraphs
- On mixed Moore graphs
- Non existence of some mixed Moore graphs of diameter 2 using SAT
- HSAGA and its application for the construction of near-Moore digraphs
- Moore bound for mixed networks
This page was built for publication: On the impossibility of directed Moore graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1250107)
