On the impossibility of directed Moore graphs
From MaRDI portal
Publication:1250107
DOI10.1016/0095-8956(80)90091-XzbMATH Open0388.05019OpenAlexW2080828846MaRDI QIDQ1250107FDOQ1250107
Authors: K. Appert
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(80)90091-x
Cites Work
Cited In (35)
- The underlying line digraph structure of some (0, 1)-matrix equations
- Switchings, extensions, and reductions in central digraphs
- On diregular digraphs with degree two and excess three
- Multipartite Moore digraphs
- Enumerations of vertex orders of almost Moore digraphs with selfrepeats
- On the weak distance-regularity of Moore-type digraphs
- 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 of degree four and five
- On mixed almost Moore graphs of diameter two
- Properties of mixed Moore graphs of directed degree one
- On large vertex-symmetric digraphs
- Super edge-connectivity of dense digraphs and graphs
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
- On the existence of \((d,k)\)-digraphs
- On mixed Moore graphs
- Non existence of some mixed Moore graphs of diameter 2 using SAT
- On mixed radial Moore graphs of diameter 3
- HSAGA and its application for the construction of near-Moore digraphs
- On the nonexistence of almost Moore digraphs
- Moore bound for mixed networks
- Directed Moore hypergraphs
- Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II
- Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism
- On networks with order close to the Moore bound
- A note on Moore Cayley digraphs
- Vertex-symmetric digraphs with small diameter
- On total regularity of mixed graphs with order close to the Moore bound
- Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
- An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph
- On diregular digraphs with degree two and excess two
- Digraphs with degree two and excess two are diregular
- Miscellaneous digraph classes
- A family of mixed graphs with large order and diameter 2
- On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices
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)