On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices
From MaRDI portal
Publication:1713317
DOI10.1016/J.LAA.2018.11.007zbMath1405.05100OpenAlexW2900310556MaRDI QIDQ1713317
Slobodan Filipovski, Jajcay, Robert
Publication date: 24 January 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2018.11.007
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Nonexistence of almost Moore digraphs of diameter three
- On the impossibility of directed Moore graphs
- Digraphs of degree two which miss the Moore bound by two
- Nonexistence of almost Moore digraphs of diameter four
- The nonexistence of certain generalized polygons
- Line Digraph Iterations and the (d, k) Digraph Problem
- Complete characterization of almost Moore digraphs of degree three
- Digraphs of degree 3 and order close to the moore bound
- Unnamed Item
- Unnamed Item
This page was built for publication: On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices