The inverse of the distance matrix of a distance well-defined graph

DOI10.1016/j.laa.2016.12.008zbMath1355.15005OpenAlexW2559784891MaRDI QIDQ503411

Hui Zhou

Publication date: 12 January 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.12.008

zbMATH Keywords

inversedistance matrixrank-one matrixdistance well-defined graphgeneralized distance matrixLaplacian-expressible matrixLaplacian-like matrix

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (8)

Distance matrix of a multi-block graph: determinant and inverse ⋮ On mixed block graphs ⋮ An inverse formula for the distance matrix of a fan graph ⋮ The bipartite Laplacian matrix of a nonsingular tree ⋮ Unnamed Item ⋮ Inverse of the distance matrix of a weighted cactoid digraph ⋮ On distance and Laplacian matrices of trees with matrix weights ⋮ Distance matrix of weighted cactoid-type digraphs

Cites Work

• On a conjecture concerning spanning tree invariants and loop systems
• Inverse of the distance matrix of a cycle-clique graph
• \(q\)-analogs of distance matrices of 3-hypertrees
• On the distance matrix of a tree
• Distance matrix polynomials of trees
• On distance matrices and Laplacians
• Inverse of the distance matrix of a cactoid digraph
• A \(q\)-analogue of the distance matrix of a tree
• Determinant of the distance matrix of a tree with matrix weights
• A simple proof of Graham and Pollak's theorem
• Inverse of the distance matrix of a block graph
• The distance matrix of a bidirected tree
• On the distance matrix of a directed graph
• On the Addressing Problem for Loop Switching

This page was built for publication: The inverse of the distance matrix of a distance well-defined graph