2-walk-regular graphs with a small number of vertices compared to the valency

DOI10.1016/j.laa.2016.07.027zbMath1352.05063OpenAlexW2481849009MaRDI QIDQ501214

Zhi Qiao, Jack H. Koolen, Jongyook Park

Publication date: 29 December 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.07.027

zbMATH Keywords

distance-regular graphsgroup divisible designsdual propertyt-walk-regular graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (3)

Partially metric association schemes with a multiplicity three ⋮ The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\) ⋮ On 2-walk-regular graphs with a large intersection number \(c_2\)

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizing \((\ell ,m)\)-walk-regular graphs
• Spectra of graphs
• Some results on the eigenvalues of distance-regular graphs
• On \(k\)-walk-regular graphs
• Bounding the diameter of distance. Regular graphs
• 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
• A new family of distance-regular graphs with unbounded diameter
• 2-walk-regular dihedrants from group-divisible designs

This page was built for publication: 2-walk-regular graphs with a small number of vertices compared to the valency