Enumerations of vertex orders of almost Moore digraphs with selfrepeats
From MaRDI portal
Publication:2463473
DOI10.1016/j.disc.2007.03.035zbMath1133.05038MaRDI QIDQ2463473
Mirka Miller, Y. M. Cholily, Edy Tri Baskoro
Publication date: 12 December 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.035
Related Items
On the nonexistence of almost Moore digraphs, Distances of centroid sets in a graph-based construction for information security applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the impossibility of directed Moore graphs
- On the existence of \((d,k)\)-digraphs
- On the structure of digraphs with order close to the Moore bound
- Almost Moore digraphs are diregular
- Minimum Diameter of Diregular Digraphs of Degree 2
- Complete characterization of almost Moore digraphs of degree three
- Combinatorial Geometry and Graph Theory
- Enumeration of almost Moore digraphs of diameter two