On subgraphs in distance-regular graphs

DOI10.1023/A:1022442717593zbMath0786.05032MaRDI QIDQ685995

Jack H. Koolen

Publication date: 1 November 1993

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

distance-regular graphshypercubes

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (8)

A distance-regular graph with bipartite geodetically closed subgraphs. ⋮ On strongly closed subgraphs of highly regular graphs ⋮ On bounding the diameter of a distance-regular graph ⋮ A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers ⋮ A unified view of inequalities for distance-regular graphs. I ⋮ A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph ⋮ An improvement of the Ivanov bound ⋮ Improving diameter bounds for distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance regular subgraphs of a cube
• Interval-regular graphs
• The structure of near polygons with quads
• Uniqueness and nonexistence of some graphs related to \(M_{22}\)
• On 2-transitive graphs of girth 5
• A new condition for distance-regular graphs
• Characterization of projective incidence structures
• On uniformly geodetic graphs
• Root systems and the Johnson and Hamming graphs
• Distance-regular graphs and (s,c,a,k)-graphs
• On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code

This page was built for publication: On subgraphs in distance-regular graphs