Distance Matrix of a Multi-block Graph: Determinant and Inverse

DOI10.1080/03081087.2020.1860886zbMATH Open1517.05099arXiv1910.01367MaRDI QIDQ6326463FDOQ6326463

Authors: Joyentanuj Das, Sumit Mohanty 

Publication date: 3 October 2019

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.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

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 Q6326463)