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

DOI10.1006/eujc.1996.0054zbMath0857.05096OpenAlexW4212987602MaRDI QIDQ1815400

Akira Hiraki

Publication date: 6 March 1997

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

Full work available at URL: https://doi.org/10.1006/eujc.1996.0054

zbMATH Keywords

distance-regular graphintersection numbersdistancediametersubgraphvalency

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (3)

A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph ⋮ Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\) ⋮ Retracing argument for distance-regular graphs

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