On bipartite graphs of diameter 3 and defect 2
From MaRDI portal
Publication:3652534
DOI10.1002/jgt.20378zbMath1186.05071MaRDI QIDQ3652534
No author found.
Publication date: 18 December 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/41411
bipartite graphs; defect; diameter problem; degree problem; bipartite Moore bound; bipartite Moore graphs
05C35: Extremal problems in graph theory
Related Items
Non-existence of bipartite graphs of diameter at least \(4\) and defect \(2\), On bipartite graphs of defect at most 4, Normally regular digraphs, TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER
Cites Work
- Unnamed Item
- Unnamed Item
- Nonexistence of certain cubic graphs with small diameters
- Normally regular digraphs
- The existence of symmetric block designs
- A characterization of PSU(3,3\(^2\)) as a permutation group of rank 4
- The Non-Existence of Finite Projective Planes of Order 10
- Graphs with even girth and small excess
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Minimal Regular Graphs of Girths Eight and Twelve
- On Minimal graphs of maximum even girth
- Combinatorial Problems
- The Nonexistence of Certain Finite Projective Planes
- Combinatorial Properties of Group Divisible Incomplete Block Designs