The bipartite Laplacian matrix of a nonsingular tree
From MaRDI portal
Publication:6048254
DOI10.1515/spma-2023-0102zbMath1521.05097MaRDI QIDQ6048254
Ravindra B. Bapat, Rakesh Jana, Sukanta Pati
Publication date: 10 October 2023
Published in: Special Matrices (Search for Journal in Brave)
Trees (05C05) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- The distance matrix of a tree with weights on its arcs
- Two Laplacians for the distance matrix of a graph
- The inverse of the distance matrix of a distance well-defined graph
- Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix
- Permanental roots and the star degree of a graph
- Inverses of trees
- Distance matrix polynomials of trees
- Inverses of bipartite graphs
- On distance matrices and Laplacians
- A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree
- The bipartite distance matrix of a nonsingular tree
- The Arithmetic Tutte polynomial of two matrices associated to Trees
- Inverses of triangular matrices and bipartite graphs
- A \(q\)-analogue of the distance matrix of a tree
- Determinant of the distance matrix of a tree with matrix weights
- The normalized distance Laplacian
- The Laplacian Spectrum of a Graph
- The distance spectrum of a tree
- On the distance matrix of a directed graph
- Squared distance matrix of a weighted tree
- On the Addressing Problem for Loop Switching
- Squared distance matrix of a tree: inverse and inertia
This page was built for publication: The bipartite Laplacian matrix of a nonsingular tree