A unified view of inequalities for distance-regular graphs. I

DOI10.1016/J.JCTB.2020.09.015MaRDI QIDQ2668024zbMATH OpenOpenAlexFDO

Authors Arnold Neumaier, Safet Penjić

Publication date 3 March 2022

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2020.09.015

zbMATH Keywords

diameter bounddistance-regular graphlinear constraint satisfaction problem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Association schemes, strongly regular graphs (05E30)

Recommendations

• Some inequalities in distance-regular graphs
• scientific article; zbMATH DE number 1379441
• On bounding the diameter of a distance-regular graph
• scientific article; zbMATH DE number 3878961
• Dual polar spaces as extremal distance-regular graphs.

Cites work

• A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers
• An inequality between intersection numbers of a distance-regular graph
• Distance-regular graphs
• Distance-regular graphs and (s,c,a,k)-graphs
• Distance-regular graphs with girth 3 or 4: I
• Distance-regular subgraphs in a distance-regular graph. V
• scientific article; zbMATH DE number 3950544 (Why is no real title available?)
• scientific article; zbMATH DE number 4023336 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3601619 (Why is no real title available?)
• scientific article; zbMATH DE number 681028 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• Improving diameter bounds for distance-regular graphs
• Kite-free distance-regular graphs
• On subgraphs in distance-regular graphs
• Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs
• Root systems and the Johnson and Hamming graphs
• Strongly closed subgraphs in a regular thick near polygon
• The diameter of bipartite distance-regular graphs
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs

Cited in

(8)

• Some elementary inequalities for distance-regular graphs
• Some inequalities in distance-regular graphs
• A new inequality for bipartite distance-regular graphs.
• On (almost) 2-Y-homogeneous distance-biregular graphs
• On bounding the diameter of a distance-regular graph
• Ricci curvature, diameter and eigenvalues of amply regular graphs
• Diameter bounds for distance-regular graphs via long-scale Ollivier Ricci curvature
• The S₃-symmetric tridiagonal algebra

This page was built for publication: A unified view of inequalities for distance-regular graphs. I

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