A relationship between the diameter and the intersection number c _2 for a distance-regular graph
From MaRDI portal
Publication:438889
Abstract: In this paper we will look at the relationship between the intersection number c2 and its diameter for a distance-regular graph. And also, we give some tools to show that a distance-regular graph with large c2 is bipartite, and a tool to show that if kD is too small then the distance-regular graph has to be antipodal.
Recommendations
- Intersection numbers of bipartite distance-regular graphs
- On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\)
- Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)
- scientific article; zbMATH DE number 2192091
- On distance-regular graphs with \(k_ i= k_ j\). II
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- Distance-regular graphs with or at least half the valency
- Interlacing eigenvalues and graphs
- Intersection numbers of bipartite distance-regular graphs
- On subgraphs in distance-regular graphs
Cited in
(7)- On bounding the diameter of a distance-regular graph
- Some remarks on the parameter \(c_2\) for a distance-regular graph with classical parameters
- Inverse problems in the theory of distance-regular graphs
- A note on distance-regular graphs with a small number of vertices compared to the valency
- The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)
- On 2-walk-regular graphs with a large intersection number \(c_2\)
- Distance-regular graphs with valency \(k\), diameter \(D \geq 3\) and at most \(Dk+1\) vertices
This page was built for publication: A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438889)
