Inverse of the distance matrix of a weighted cactoid digraph

Hui Zhou, Qi Ding and Ruiling Jia

Applied Mathematics and Computation, 2019, vol. 362, issue C, -

Abstract: A weighted cactoid digraph is a strongly connected directed graph whose blocks are weighted directed cycles such that any two distinct weighted directed cycles of this graph share at most one common vertex. In this paper, we give the determinant and the inverse of the distance matrix of a weighted cactoid digraph, which imply Graham and Pollak’s formula and the inverse of the distance matrix of a tree.

Keywords: Weighted directed cycle; Weighted cactoid digraph; Distance matrix; Determinant; Inverse (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319305351
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:362:y:2019:i:c:49

DOI: 10.1016/j.amc.2019.06.066

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().