The exponential distance matrix of block graphs

Rundan Xing and Zhibin Du

Applied Mathematics and Computation, 2023, vol. 447, issue C

Abstract: Let G be a connected graph with vertex set {v1,v2,⋯,vn}. As a variant of distance matrix, the exponential distance matrix was proposed by Yan and Yeh, and Bapat et al. independently. Given a nonzero indeterminate q, the exponential distance matrix F=(Fij)n×n of G is defined as Fij=qDij, where Dij is the distance between vertices vi and vj in G (i.e., the (i,j)-entry of the distance matrix of G).

Keywords: Exponential distance matrix; Block graph; Determinant; Inverse; Cofactor sum (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032200741X
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:447:y:2023:i:c:s009630032200741x

DOI: 10.1016/j.amc.2022.127673

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 ().