Distance Matrix of Weighted Cactoid-type Digraphs
Combinatorics
2020-09-25 v3
Abstract
A strongly connected digraph is called a cactoid-type if each of its blocks is a digraph consisting of finitely many oriented cycles sharing a common directed path. In this article, we find the formula for the determinant of the distance matrix for weighted cactoid-type digraphs and find its inverse, whenever it exists. We also compute the determinant of the distance matrix for a class of unweighted and undirected graphs consisting of finitely many cycles, sharing a common path.
Keywords
Cite
@article{arxiv.2001.11262,
title = {Distance Matrix of Weighted Cactoid-type Digraphs},
author = {Joyentanuj Das and Sumit Mohanty},
journal= {arXiv preprint arXiv:2001.11262},
year = {2020}
}