Distance matrix of a multi-block graph: determinant and inverse
From MaRDI portal
Publication:5887661
DOI10.1080/03081087.2020.1860886OpenAlexW3114433168MaRDI QIDQ5887661
Publication date: 13 April 2023
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.01367
Related Items (2)
An inverse formula for the distance matrix of a fan graph ⋮ Distance matrix of weighted cactoid-type digraphs
Cites Work
- Unnamed Item
- The inverse of the distance matrix of a distance well-defined graph
- Inverse of the distance matrix of a cycle-clique graph
- Distance matrix of a class of completely positive graphs: determinant and inverse
- Distance matrix polynomials of trees
- The Schur complement and its applications
- Inverse of the distance matrix of a weighted cactoid digraph
- Inverse of the distance matrix of a cactoid digraph
- Inverse of the distance matrix of a block graph
- On the distance matrix of a directed graph
- On the Addressing Problem for Loop Switching
- Inverse of the distance matrix of a bi-block graph
- Graphs and matrices
- Matrix theory. Basic results and techniques
This page was built for publication: Distance matrix of a multi-block graph: determinant and inverse