On local spectra of classical distance-regular graphs with b = 2
Alexander L. Gavrilyuk, Janoš Vidali
Abstract
Using a combination of spectral techniques and combinatorial counts, we prove a number of non-existence results for putative distance-regular graphs with classical parameters, focusing on the case b=2. Among those, the case (d,b,α,β)=(d,2,1,2d-2) passed all known feasibility conditions and required a deeper combinatorial analysis, from which nonexistence has been derived whenever d 9. In doing so, we constructed a new family of regular graphs with four distinct eigenvalues which would have been local graphs in such a distance-regular graph.
Create a lesson
Related papers
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz