Distance-regular graphs with exactly one positive \(q\)-distance eigenvalue

DOI10.1016/j.laa.2024.02.030arXiv2305.14636OpenAlexW4392454532MaRDI QIDQ6131336

Jack H. Koolen, Sakander Hayat, Mamoon Abdullah, Brhane Gebremichel

Publication date: 5 April 2024

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

Full work available at URL: https://arxiv.org/abs/2305.14636

zbMATH Keywords

distance-regular graphsclassical typeclassical parameters\(q\)-distance matrix

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• On the distance spectra of graphs
• Distance-regular graphs
• Spectra of graphs
• \(q\)-analogs of distance matrices of 3-hypertrees
• A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
• Distance-regular graphs the distance matrix of which has only one positive eigenvalue
• A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree
• Algebraic combinatorics. Translated from the Japanese
• On the determinant of \(q\)-distance matrix of a graph
• A \(q\)-analogue of the distance matrix of a tree
• A new family of distance-regular graphs with unbounded diameter
• A q-Analogue of the Addressing Problem of Graphs by Graham and Pollak
• The generalized distance spectrum of a graph and applications
• Geometry of cuts and metrics
• On association schemes generated by a relation or an idempotent

This page was built for publication: Distance-regular graphs with exactly one positive \(q\)-distance eigenvalue