Inverses of q-distance matrices of a tree
From MaRDI portal
Recommendations
- A \(q\)-analogue of the distance matrix of a tree
- \(q\)-analogs of distance matrices of 3-hypertrees
- A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
- On the determinant of \(q\)-distance matrix of a graph
- The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations
Cites work
- A \(q\)-analogue of the distance matrix of a tree
- A simple proof of Graham and Pollak's theorem
- Distance matrix polynomials of trees
- Graph theory
- On distance matrices and Laplacians
- On the Addressing Problem for Loop Switching
- Parallel concepts in graph theory
- The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations
- Zeta functions of finite graphs and coverings
- Zeta functions of line, middle, total graphs of a graph and their coverings
Cited in
(12)- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
- \(q\)-analogs of distance matrices of 3-hypertrees
- The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations
- On the determinant of \(q\)-distance matrix of a graph
- Another simple proof of Graham and Pollak's theorem
- A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
- Inverse of the distance matrix of a cactoid digraph
- Distance matrices of a tree: two more invariants, and in a unified framework
- Minimal ∞-norm of generalized inverses of the incidence matrix of a tree
- A \(q\)-analogue of the distance matrix of a tree
- A simple proof of Graham and Pollak's theorem
- A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree
This page was built for publication: Inverses of \(q\)-distance matrices of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732087)