Distance Matrix of Weighted Cactoid-type Digraphs

2020/01/30 by Das, Joyentanuj, Mohanty, Sumit · 3 citations
#05C12 #05C50 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2001.11262

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.

Cited by

• The exponential distance matrix of bi-block graphs
• A q-analogue of distance matrix of bi-block graphs
• On the Squared Distance Matrix of a Starlike Block Graph

Related

• On distance matrices of graphs
• The determinant of the distance matrix of graphs with at most two cycles
• Distance Matrix of a Multi-block Graph: Determinant and Inverse
• Distance ideals of digraphs
• On the determinant of the distance matrix of a bicyclic graph