Pages that link to "Item:Q1361464"
From MaRDI portal
The following pages link to A characterization of distance-regular graphs with diameter three (Q1361464):
Displaying 21 items.
- A new characterization of taut distance-regular graphs of odd diameter (Q393160) (← links)
- Extremal 1-codes in distance-regular graphs of diameter 3 (Q438900) (← links)
- 3-bounded property in a triangle-free distance-regular graph (Q942133) (← links)
- Three-class association schemes (Q1296390) (← links)
- From local adjacency polynomials to locally pseudo-distance-regular graphs (Q1366602) (← links)
- Bounds on special subsets in graphs, eigenvalues and association schemes (Q1386530) (← links)
- Spectral bounds and distance-regularity (Q1774959) (← links)
- Distance-regularity and the spectrum of graphs (Q1911436) (← links)
- On bounding the diameter of a distance-regular graph (Q2151185) (← links)
- Neumaier graphs with few eigenvalues (Q2168070) (← links)
- Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\) (Q2174419) (← links)
- Normal quotients of diameter at most two of finite three-geodesic-transitive graphs (Q2221819) (← links)
- The Laplacian spectral excess theorem for distance-regular graphs (Q2250930) (← links)
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible (Q2283214) (← links)
- On 3-chromatic distance-regular graphs (Q2384050) (← links)
- Three distance characteristic polynomials of some graphs (Q2451677) (← links)
- Spectral determinations and eccentricity matrix of graphs (Q2672953) (← links)
- Characterization of \(n\)-vertex graphs with metric dimension \({n-3}\). (Q2925938) (← links)
- Characerization of a class of distance regular graphs. (Q3344020) (← links)
- DDR Graphs of Diameter Three (Q3439046) (← links)
- Pseudo-Strong Regularity Around a Set (Q4542167) (← links)
