Distance Matrix of a Multi-block Graph: Determinant and Inverse
Combinatorics
2020-09-25 v4
Abstract
A connected graph is called a multi-block graph if each of its blocks is a complete multi-partite graph. Building on the work of \cite{Bp3,Hou3}, we compute the determinant and inverse of the distance matrix for a class of multi-block graphs.
Cite
@article{arxiv.1910.01367,
title = {Distance Matrix of a Multi-block Graph: Determinant and Inverse},
author = {Joyentanuj Das and Sumit Mohanty},
journal= {arXiv preprint arXiv:1910.01367},
year = {2020}
}