Cycle-balance conditions for distance-regular graphs
From MaRDI portal
Publication:1869251
DOI10.1016/S0012-365X(02)00557-5zbMath1017.05105OpenAlexW2140115032MaRDI QIDQ1869251
Publication date: 9 April 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00557-5
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (11)
Completely regular codes in Johnson and Grassmann graphs with small covering radii ⋮ Perfect 2-colorings of the Johnson graph \(J(9, 4)\) ⋮ Intriguing sets of vertices of regular graphs ⋮ On completely regular codes with minimum eigenvalue in geometric graphs ⋮ Equitable 2-partitions of the Hamming graphs with the second eigenvalue ⋮ Perfect 2‐colorings of Hamming graphs ⋮ On completely regular codes ⋮ Sporadic neighbour-transitive codes in Johnson graphs ⋮ Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency ⋮ On Perfect 2‐Colorings of Johnson Graphs J(v, 3) ⋮ Neighbour-transitive codes in Johnson graphs
This page was built for publication: Cycle-balance conditions for distance-regular graphs
