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

DOI10.1016/J.LAA.2016.07.027MaRDI QIDQ501214zbMATH OpenOpenAlexFDO

Authors 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 graphsdual propertygroup divisible designst-walk-regular graphs

Mathematics Subject Classification ID

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

Recommendations

• A note on distance-regular graphs with a small number of vertices compared to the valency
• On 2-walk-regular graphs with a large intersection number \(c_2\)
• Geometric aspects of 2-walk-regular graphs
• The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)
• Distance-regular graphs with or at least half the valency

Cites work

• 2-walk-regular dihedrants from group-divisible designs
• A new family of distance-regular graphs with unbounded diameter
• A note on distance-regular graphs with a small number of vertices compared to the valency
• An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
• Bounding the diameter of distance. Regular graphs
• Characterizing ( ,m)-walk-regular graphs
• Geometric aspects of 2-walk-regular graphs
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3341050 (Why is no real title available?)
• On \(k\)-walk-regular graphs
• On almost distance-regular graphs
• Some results on the eigenvalues of distance-regular graphs
• Spectra of graphs

Cited in

(7)

• Partially metric association schemes with a multiplicity three
• On 2-walk-regular graphs with a large intersection number \(c_2\)
• Geometric aspects of 2-walk-regular graphs
• A note on distance-regular graphs with a small number of vertices compared to the valency
• 2-Walk linear graphs with small number of cycles
• Distance-regular graphs with valency \(k\), diameter \(D \geq 3\) and at most \(Dk+1\) vertices
• The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)

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

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