On networks with order close to the Moore bound
From MaRDI portal
Publication:2165254
DOI10.1007/s00373-022-02535-6zbMath1495.05079arXiv2108.05820OpenAlexW3187592568MaRDI QIDQ2165254
Publication date: 19 August 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.05820
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On mixed almost Moore graphs of diameter two
- Mixed Moore Cayley graphs
- A revised Moore bound for mixed graphs
- Sequence mixed graphs
- A family of mixed graphs with large order and diameter 2
- Coloring some classes of mixed graphs
- On mixed Moore graphs
- Non existence of some mixed Moore graphs of diameter 2 using SAT
- Nonexistence of almost Moore digraphs of diameter three
- Regular graphs with excess one
- On the impossibility of directed Moore graphs
- Digraphs on permutations
- An improved upper bound for the order of mixed graphs
- On digraphs of excess one
- Nonexistence of almost Moore digraphs of diameter four
- On total regularity of mixed graphs with order close to the Moore bound
- Mixed cages
- Dynamic cage survey
- New mixed Moore graphs and directed strongly regular graphs
- Construction of extremal mixed graphs of diameter two
- Moore graphs and beyond: a survey of the degree/diameter problem
- On Moore Graphs with Diameters 2 and 3
- Connectivity of cages
- On k-geodetic digraphs with excess one
- Regular Graphs with Given Girth and Restricted Circuits
- Enumeration of almost Moore digraphs of diameter two
This page was built for publication: On networks with order close to the Moore bound
