The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)

DOI10.1016/j.disc.2016.09.022zbMath1351.05065MaRDI QIDQ729793

Jongyook Park

Publication date: 22 December 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.09.022

zbMATH Keywords

distance-regular graphs; antipodal distance-regular graphs; \(M\)-property; 2-walk-regular graphs

Mathematics Subject Classification ID

05C12: Distance in graphs

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph
• 2-walk-regular graphs with a small number of vertices compared to the valency
• The distance-regular graphs such that all of its second largest local eigenvalues are at most one
• Distance-regular graphs with or at least half the valency
• Shilla distance-regular graphs
• The distance-regular graphs of valency four
• Determination of the distance-regular graphs without 3-claws
• An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
• On almost distance-regular graphs
• Geometric aspects of 2-walk-regular graphs
• A note on distance-regular graphs with a small number of vertices compared to the valency
• Distance–regular graphs having theM-property
• Spectral and Geometric Properties of k-Walk-Regular Graphs
• Cubic Distance-Regular Graphs