Distance-regular subgraphs in a distance-regular graph. I

DOI10.1016/0195-6698(95)90040-3zbMath0836.05080OpenAlexW4205657677MaRDI QIDQ1902965

Akira Hiraki

Publication date: 22 April 1996

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

Full work available at URL: https://doi.org/10.1016/0195-6698(95)90040-3

zbMATH Keywords

distance-regular graphMoore graphintersection arraydistance-regular subgraph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Combinatorial aspects of finite geometries (05B25)

Related Items (4)

Distance-regular subgraphs in a distance-regular graph. II ⋮ Retracing argument for distance-regular graphs ⋮ An improvement of the Ivanov bound ⋮ A distance-regular graph with strongly closed subgraphs

Cites Work

• A remark on the intersection arrays of distance-regular graphs
• Distance-regular subgraphs in a distance-regular graph. II
• A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph
• CIRCUIT CHASING TECHNIQUE FOR A DISTANCE-REGULAR GRAPH WITH c 2r+1=1
• Unnamed Item
• Unnamed Item

This page was built for publication: Distance-regular subgraphs in a distance-regular graph. I