On the determinant of \(q\)-distance matrix of a graph
From MaRDI portal
Publication:2442272
DOI10.7151/dmgt.1720zbMath1292.05174OpenAlexW1974930588MaRDI QIDQ2442272
Jing Zhang, Li Su, Hong-Hai Li
Publication date: 2 April 2014
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1720
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Directed graphs (digraphs), tournaments (05C20)
Related Items
Distance matrices of a tree: two more invariants, and in a unified framework ⋮ A \(q\)-analogue of distance matrix of block graphs ⋮ Distance-regular graphs with exactly one positive \(q\)-distance eigenvalue ⋮ Unnamed Item ⋮ Another simple proof of Graham and Pollak's theorem ⋮ A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree
Cites Work
- Unnamed Item
- Inverses of \(q\)-distance matrices of a tree
- A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
- On distance matrices and Laplacians
- The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations
- A \(q\)-analogue of the distance matrix of a tree
- The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- On the distance matrix of a directed graph
- On the Addressing Problem for Loop Switching