Distance-regular graphs with exactly one positive q-distance eigenvalue
DOI10.1016/J.LAA.2024.02.030arXiv2305.14636OpenAlexW4392454532MaRDI QIDQ6131336FDOQ6131336
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
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)
Cites Work
- Title not available (Why is that?)
- Spectra of graphs
- Distance-regular graphs the distance matrix of which has only one positive eigenvalue
- On the distance spectra of graphs
- Title not available (Why is that?)
- Geometry of cuts and metrics
- A \(q\)-analogue of the distance matrix of a tree
- Distance-regular graphs
- A new family of distance-regular graphs with unbounded diameter
- \(q\)-analogs of distance matrices of 3-hypertrees
- On the determinant of \(q\)-distance matrix of a graph
- A \(q\)-analogue of the addressing problem of graphs by Graham and Pollak
- A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
- On association schemes generated by a relation or an idempotent
- Algebraic combinatorics. Translated from the Japanese
- A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree
- The generalized distance spectrum of a graph and applications
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)