On distance-regular graphs with height two

DOI10.1023/A:1022440414422zbMATH Open0843.05104MaRDI QIDQ1906253FDOQ1906253

Authors: Masato Tomiyama 

Publication date: 13 August 1996

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

Recommendations

• On distance-regular graphs with height two. II
• scientific article; zbMATH DE number 43547
• Distance-regular graphs of the height \(h\)
• On local structure of a distance-regular graph of Hamming type
• On a distance-regular graph of even height with \(k_e=k_f\)

zbMATH Keywords

distancestrongly regular graphdiameterdistance-regular graphcliqueheight

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Second neighbourhoods of strongly regular graphs
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• Characerization of a class of distance regular graphs.
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
• A remark on the intersection arrays of distance-regular graphs
• Bounding the diameter of a distance regular graph by a function of \(k_ d\)

Cited In (5)

• On distance-regular graphs with height two. II
• Two distance-regular graphs
• On local structure of a distance-regular graph of Hamming type
• Distance-regular graphs of large diameter that are completely regular clique graphs
• Distance-regular graphs of the height \(h\)

This page was built for publication: On distance-regular graphs with height two

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