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

DOI10.1016/j.jctb.2020.09.015zbMath1483.05204OpenAlexW3091977732MaRDI QIDQ2668024

Safet Penjić, Arnold Neumaier

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

distance-regular graphdiameter boundlinear constraint satisfaction problem

Mathematics Subject Classification ID

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

Related Items (2)

On bounding the diameter of a distance-regular graph ⋮ On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs

Cites Work

• Distance-regular graphs
• On subgraphs in distance-regular graphs
• A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
• Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs
• Distance-regular graphs with girth 3 or 4: I
• An inequality between intersection numbers of a distance-regular graph
• The diameter of bipartite distance-regular graphs
• Distance-regular subgraphs in a distance-regular graph. V
• Root systems and the Johnson and Hamming graphs
• Distance-regular graphs and (s,c,a,k)-graphs
• Kite-free distance-regular graphs
• Strongly closed subgraphs in a regular thick near polygon
• Improving diameter bounds for distance-regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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