Path matrix and path energy of graphs

Aleksandar Ilić and Milan Bašić

Applied Mathematics and Computation, 2019, vol. 355, issue C, 537-541

Abstract: Given a graph G, we associate to it a path matrix P whose (i, j) entry represents the maximum number of vertex disjoint paths between the vertices i and j, with zeros on the main diagonal. In this note, we resolve four conjectures from Shikare et al. (2018) on the path energy of graphs and finally present efficient O(|E||V|3) algorithm for computing the path matrix used for verifying computational results.

Keywords: Graph energy; Path graph; Ford-Fulkerson algorithm; Unicyclic graphs (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031930195X
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:355:y:2019:i:c:p:537-541

DOI: 10.1016/j.amc.2019.03.002

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