The path-index of a graph

Leyou Xu and Bo Zhou

Applied Mathematics and Computation, 2024, vol. 461, issue C

Abstract: For a graph, its path-index is the greatest eigenvalue of its path-matrix, whose (x,y)-entry for vertices x and y equals the connectivity of x and y if x≠y and 0 otherwise. Some upper and lower bounds are established on the path-index over graphs with prescribed parameters, and those graphs that attain the bounds are also identified.

Keywords: Path-matrix; Path-index; Average connectivity (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323004812
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:461:y:2024:i:c:s0096300323004812

DOI: 10.1016/j.amc.2023.128312

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