Distance-regular graphs with exactly one positive q-distance eigenvalue

DOI10.1016/J.LAA.2024.02.030MaRDI QIDQ6131336zbMATH OpenOpenAlexFDO

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

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

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

Abstract: In this paper, we study the $q$-distance matrix for a distance-regular graph and show that the $q$-distance matrix of a distance-regular graph with classical parameters ($$) has exactly three distinct eigenvalues, of which one is zero. Moreover, we study distance-regular graphs whose $q$-distance matrix has exactly one positive eigenvalue.

Recommendations

• On the distance spectrum of distance regular graphs
• Distance-regular graphs with small number of distinct distance eigenvalues
• A characterization of Q-polynomial distance-regular graphs
• A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers
• The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
• A \(q\)-analogue of the addressing problem of graphs by Graham and Pollak
• A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree
• A \(q\)-analogue of the distance matrix of a tree
• A new family of distance-regular graphs with unbounded diameter
• Algebraic combinatorics. Translated from the Japanese
• Distance-regular graphs
• Distance-regular graphs the distance matrix of which has only one positive eigenvalue
• Geometry of cuts and metrics
• On association schemes generated by a relation or an idempotent
• On the determinant of \(q\)-distance matrix of a graph
• On the distance spectra of graphs
• Spectra of graphs
• The generalized distance spectrum of a graph and applications
• \(q\)-analogs of distance matrices of 3-hypertrees

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

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