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ć
Publication date: 28 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Abstract: Given a graph , we associate a path matrix whose entry represents the maximum number of vertex disjoint paths between the vertices and , 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 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)
- Title not available (Why is that?)
- The generalized path matrix and energy
- On P(k) path eigenvalues and P(k) path energy of graphs
- On path energy of graphs
- On the path energy of bicyclic graphs
- On conjectures of network distance measures by using graph spectra
- Title not available (Why is that?)
- Edge-connectivity matrices and their spectra
- The path-index of a graph
- On the path matrices of graphs and their properties
- On path eigenvalues and path energy of graphs
- Path intersection matrices and applications to networks
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)