Abstract
A connected graph is called a multi-block graph if each of its blocks is a complete multipartite graph. We consider the distance matrix of multi-block graphs with blocks whose distance matrices have nonzero cofactor. In this case, if the distance matrix of a multi-block graph is invertible, we find the inverse as a rank one perturbation of a multiple of a Laplacian-like matrix. We also provide the inverse of the distance matrix for a class of multi-block graphs in which the distance matrix of one of its block has zero cofactor.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
