Distance matrices of a tree: two more invariants, and in a unified framework
From MaRDI portal
Publication:6081116
DOI10.1016/j.ejc.2023.103787arXiv1903.11566MaRDI QIDQ6081116
Apoorva Khare, Projesh Nath Choudhury
Publication date: 25 October 2023
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.11566
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The product distance matrix of a tree with matrix weights on its arcs
- The distance matrix of a tree with weights on its arcs
- Inverses of \(q\)-distance matrices of a tree
- Inverse of the distance matrix of a cycle-clique graph
- \(q\)-analogs of distance matrices of 3-hypertrees
- A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
- Distance matrix polynomials of trees
- On distance matrices and Laplacians
- Inverse of the distance matrix of a cactoid digraph
- On the determinant of \(q\)-distance matrix of a graph
- Inverses of triangular matrices and bipartite graphs
- 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
- Product distance matrix of a tree with matrix weights
- The distance matrix of a bidirected tree
- On the distance matrix of a directed graph
- Combinatorial Nullstellensatz
- Product distance matrix of a graph and squared distance matrix of a tree
- On the Addressing Problem for Loop Switching
This page was built for publication: Distance matrices of a tree: two more invariants, and in a unified framework