Distance-regular graphs of the height h

DOI10.1007/S003730050075MaRDI QIDQ1961760zbMATH OpenOpenAlexFDO

Authors Akira Hiraki

Publication date 5 July 2000

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003730050075

zbMATH Keywords

cliquediameterdistance-regular graphheight

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Recommendations

• On distance-regular graphs with height two
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• On distance-regular graphs with height two. II
• Distance-regular graphs with \(b_ i=c_{d-i}\) and two P-polynomial structures
• On a distance-regular graph of even height with k_e=k_f

Cited in

(3)

• On distance-regular graphs with height two. II
• On distance-regular graphs with height two
• On a distance-regular graph of even height with k_e=k_f

This page was built for publication: Distance-regular graphs of the height \(h\)

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