The bipartite distance matrix of a nonsingular tree
DOI10.1016/J.LAA.2021.09.001zbMATH Open1476.05107OpenAlexW3196387420MaRDI QIDQ2238873FDOQ2238873
Authors: R. B. Bapat, Rakesh Jana, S. Pati 
Publication date: 2 November 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2021.09.001
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Determinants, permanents, traces, other special matrix functions (15A15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- On the Addressing Problem for Loop Switching
- On the distance matrix of a tree
- Distance matrix polynomials of trees
- Title not available (Why is that?)
- A \(q\)-analogue of the distance matrix of a tree
- The distance matrix of a tree with weights on its arcs
- Squared distance matrix of a weighted tree
- On the distance matrix of a directed graph
- On distance matrices and Laplacians
- Squared distance matrix of a tree: inverse and inertia
Cited In (7)
- Four-point condition matrices of edge-weighted trees
- On the distance energy of \(k\)-uniform hypergraphs
- Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
- On the distance eigenvalues of design graphs
- The bipartite Laplacian matrix of a nonsingular tree
- The distance matrix of a bidirected tree
- A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree
This page was built for publication: The bipartite distance matrix of a nonsingular tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238873)
