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

DOI10.1006/EUJC.1996.0054zbMATH Open0857.05096OpenAlexW4212987602MaRDI QIDQ1815400FDOQ1815400

Authors: 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

Recommendations

• Distance-regular subgraphs in a distance-regular graph. V
• Distance-regular subgraphs in a distance-regular graph. IV
• Distance-regular subgraphs in a distance-regular graph. VI
• Distance-regular subgraphs in a distance-regular graph. I
• On subgraphs in distance-regular graphs

zbMATH Keywords

distancediameterdistance-regular graphintersection numberssubgraphvalency

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cited In (6)

• Distance-regular subgraphs in a distance-regular graph. II
• Distance-regular subgraphs in a distance-regular graph. I
• Distance-residual subgraphs
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815400)