On bipartite graphs of defect at most 4
From MaRDI portal
Publication:765348
DOI10.1016/j.dam.2011.09.002zbMath1241.05022arXiv1010.5651MaRDI QIDQ765348
Guillermo Pineda-Villavicencio, Ramiro Feria-Purón
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.5651
defect; repeat; Moore bipartite bound; degree/diameter problem for bipartite graphs; Moore bipartite graph
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C12: Distance in graphs
05C07: Vertex degrees
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-existence of bipartite graphs of diameter at least \(4\) and defect \(2\)
- Nonexistence of certain cubic graphs with small diameters
- On bipartite graphs of defect 2
- Cycles in strong oriented graphs
- The nonexistence of certain generalized polygons
- On bipartite graphs of diameter 3 and defect 2
- Graphs with even girth and small excess
- Fast generation of regular graphs and construction of cages
- Minimal Regular Graphs of Girths Eight and Twelve
- On Minimal graphs of maximum even girth