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

DOI10.1016/0195-6698(95)90041-1zbMath0836.05081OpenAlexW1979676428MaRDI QIDQ1902966

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)90041-1

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 (2)

Distance-regular subgraphs in a distance-regular graph. I ⋮ Retracing argument for distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A remark on the intersection arrays of distance-regular graphs
• A circuit chasing technique in a distance-regular graph with triangles
• Distance-regular subgraphs in a distance-regular graph. I
• CIRCUIT CHASING TECHNIQUE FOR A DISTANCE-REGULAR GRAPH WITH c 2r+1=1

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