Inverses of \(q\)-distance matrices of a tree
From MaRDI portal
Publication:732087
DOI10.1016/j.laa.2009.06.032zbMath1175.05031OpenAlexW2040449402MaRDI QIDQ732087
Pritha Rekhi, Ravindra B. Bapat
Publication date: 9 October 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.06.032
Trees (05C05) Theory of matrix inversion and generalized inverses (15A09) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (3)
Distance matrices of a tree: two more invariants, and in a unified framework ⋮ On the determinant of \(q\)-distance matrix of a graph ⋮ Inverse of the distance matrix of a cactoid digraph
Cites Work
- Unnamed Item
- Zeta functions of line, middle, total graphs of a graph and their coverings
- Distance matrix polynomials of trees
- Parallel concepts in graph theory
- On distance matrices and Laplacians
- Zeta functions of finite graphs and coverings
- The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations
- A \(q\)-analogue of the distance matrix of a tree
- A simple proof of Graham and Pollak's theorem
- On the Addressing Problem for Loop Switching
This page was built for publication: Inverses of \(q\)-distance matrices of a tree