论文标题
加权仙女型挖掘的距离矩阵
Distance Matrix of Weighted Cactoid-type Digraphs
论文作者
论文摘要
如果其每个块都是由有限的许多定向的循环组成，共享一个共同的定向路径，则称为仙女型的digraph被称为仙女型。在本文中，我们找到了加权仙人掌型挖掘的距离矩阵决定因素的公式，并且每当存在时都会发现其逆矩阵。我们还计算了一类未加权和未方向图的距离矩阵的决定因素，该图由有限的许多周期组成，共享了一个共同的路径。
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.
