Distance matrix of a multi-block graph: determinant and inverse
From MaRDI portal
Recommendations
Cites work
- Distance matrix of a class of completely positive graphs: determinant and inverse
- Distance matrix polynomials of trees
- Graphs and matrices
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- Inverse of the distance matrix of a bi-block graph
- Inverse of the distance matrix of a block graph
- Inverse of the distance matrix of a cactoid digraph
- Inverse of the distance matrix of a cycle-clique graph
- Inverse of the distance matrix of a weighted cactoid digraph
- Matrix theory. Basic results and techniques
- On the Addressing Problem for Loop Switching
- On the distance matrix of a directed graph
- The inverse of the distance matrix of a distance well-defined graph
- The Schur complement and its applications
Cited in
(15)- On the second largest distance eigenvalue of a block graph
- The determinant of the distance matrix of graphs with blocks at most bicyclic
- The exponential distance matrix of block graphs
- Inverse of the distance matrix of a block graph
- On mixed block graphs
- scientific article; zbMATH DE number 825123 (Why is no real title available?)
- The inverse of the distance matrix of a distance well-defined graph
- Inverse of the distance matrix of a bi-block graph
- Distance matrix of weighted cactoid-type digraphs
- An inverse formula for the distance matrix of a fan graph
- Distance Matrix of a Multi-block Graph: Determinant and Inverse
- Inverse of the squared distance matrix of a complete multipartite graph
- Inverse of the distance matrix of a cycle-clique graph
- Distance matrix of a class of completely positive graphs: determinant and inverse
- Resistance matrices of blocks in a graph
This page was built for publication: Distance matrix of a multi-block graph: determinant and inverse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5887661)