Some elementary inequalities for distance-regular graphs

DOI10.1006/EUJC.1993.1008MaRDI QIDQ1209291zbMATH OpenOpenAlexFDO

Authors Ernst W. Lambeck

Publication date 16 May 1993

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

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

zbMATH Keywords

distance-regular graphselementary inequalities

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph theory (05C99)

Review text

The title explains the short paper.

Recommendations

• Some inequalities in distance-regular graphs
• A new inequality for distance-regular graphs
• A unified view of inequalities for distance-regular graphs. I
• scientific article; zbMATH DE number 4106886
• An inequality between intersection numbers of a distance-regular graph
• An inequality on the cosines of a tight distance-regular graph
• A new inequality for bipartite distance-regular graphs.
• On almost distance-regular graphs
• ON DISTANCE-i-GRAPHS OF DISTANCE-REGULAR GRAPHS
• A bound for the diameter of distance-regular graphs

Cited in

(4)

• A new inequality for bipartite distance-regular graphs.
• Using symbolic computation to prove nonexistence of distance-regular graphs
• The least Euclidean distortion constant of a distance-regular graph
• Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)

This page was built for publication: Some elementary inequalities for distance-regular graphs

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