Path matrix and path energy of graphs

From MaRDI portal
Publication:2009405

DOI10.1016/J.AMC.2019.03.002zbMATH Open1428.05194arXiv1810.04870OpenAlexW2897140837WikidataQ128204864 ScholiaQ128204864MaRDI QIDQ2009405FDOQ2009405


Authors: Aleksandar Ilić, Milan Bašić Edit this on Wikidata


Publication date: 28 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Abstract: Given a graph G, we associate 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 [M. M. Shikare, P. P. Malavadkar, S. C. Patekar, I. Gutman, emph{On Path Eigenvalues and Path Energy of Graphs}, MATCH Commun. Math. Comput. Chem. {�f 79} (2018), 387--398.] 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.


Full work available at URL: https://arxiv.org/abs/1810.04870




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Path matrix and path energy of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009405)