Inverse of the distance matrix of a bi-block graph

DOI10.1080/03081087.2015.1099599zbMath1341.05139OpenAlexW1803416476MaRDI QIDQ5741223

Yajing Sun, Yao-Ping Hou

Publication date: 22 July 2016

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

Full work available at URL: https://doi.org/10.1080/03081087.2015.1099599

zbMATH Keywords

complete bipartite graphdeterminantinversedistance matrix

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Connectivity (05C40)

Related Items (8)

Distance matrix of a multi-block graph: determinant and inverse ⋮ Distance matrix of a class of completely positive graphs: determinant and inverse ⋮ On mixed block graphs ⋮ An inverse formula for the distance matrix of a fan graph ⋮ An inverse formula for the distance matrix of a wheel graph with an even number of vertices ⋮ On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices ⋮ Inverse of the distance matrix of a weighted cactoid digraph ⋮ Distance matrix of weighted cactoid-type digraphs

Cites Work

• \(q\)-analogs of distance matrices of 3-hypertrees
• 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
• Product distance matrix of a tree with matrix weights
• Inverse of the distance matrix of a block graph
• On the distance matrix of a directed graph

This page was built for publication: Inverse of the distance matrix of a bi-block graph