Distance Matrix of a Multi-block Graph: Determinant and Inverse
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 Bp3,Hou3, we compute the determinant and inverse of the distance matrix for a class of multi-block graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.