On total regularity of mixed graphs with order close to the Moore bound
From MaRDI portal
Publication:2287724
DOI10.1007/S00373-019-02114-2zbMath1440.05130arXiv1811.00650OpenAlexW2982557387MaRDI QIDQ2287724
Publication date: 21 January 2020
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.00650
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)
Related Items (3)
On networks with order close to the Moore bound ⋮ Moore mixed graphs from Cayley graphs ⋮ On total regularity of mixed graphs with order close to the Moore bound
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On mixed almost Moore graphs of diameter two
- A revised Moore bound for mixed graphs
- On mixed Moore graphs
- Nonexistence of almost Moore digraphs of diameter three
- On the impossibility of directed Moore graphs
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
- On digraphs of excess one
- Nonexistence of almost Moore digraphs of diameter four
- Almost Moore digraphs are diregular
- On total regularity of mixed graphs with order close to the Moore bound
- Dynamic cage survey
- New mixed Moore graphs and directed strongly regular graphs
- Moore graphs and beyond: a survey of the degree/diameter problem
- On Moore Graphs with Diameters 2 and 3
- Maximum degree in graphs of diameter 2
- Complete characterization of almost Moore digraphs of degree three
- On k-geodetic digraphs with excess one
This page was built for publication: On total regularity of mixed graphs with order close to the Moore bound
