On new record graphs close to bipartite Moore graphs
From MaRDI portal
Publication:2152609
DOI10.1007/s00373-022-02500-3zbMath1492.05123arXiv2005.02427OpenAlexW3023977152MaRDI QIDQ2152609
Publication date: 8 July 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.02427
Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Uses Software
Cites Work
- Radial Moore graphs of radius three
- Families of small regular graphs of girth 5
- HSAGA and its application for the construction of near-Moore digraphs
- Geometric realisation of the graphs of McKay-Miller-Širáň
- On the existence of radial Moore graphs for every radius and every degree
- On large bipartite graphs of diameter 3
- Mixed cages: monotonicity, connectivity and upper bounds
- Dynamic cage survey
- New small regular graphs of girth 5
- Moore graphs and beyond: a survey of the degree/diameter problem
- Ranking measures for radially Moore graphs
- Large Graphs with Given Degree and Diameter—Part I
- Large Graphs with Given Degree and Diameter III
- Abstract Algebra
- On bipartite‐mixed graphs
This page was built for publication: On new record graphs close to bipartite Moore graphs