Path matrix and path energy of graphs
From MaRDI portal
Publication:2009405
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.
Recommendations
Cites work
Cited in
(15)- On conjectures of network distance measures by using graph spectra
- Edge-connectivity matrices and their spectra
- On the path matrices of graphs and their properties
- scientific article; zbMATH DE number 1522763 (Why is no real title available?)
- scientific article; zbMATH DE number 7407637 (Why is no real title available?)
- On path eigenvalues and path energy of graphs
- On path energy of graphs
- On the path energy of bicyclic graphs
- Path intersection matrices and applications to networks
- On P(k) path eigenvalues and P(k) path energy of graphs
- The path-index of a graph
- The generalized path matrix and energy
- On path eigenvalues of some graphs
- Bounds on the largest eigenvalue and energy of the connectivity matrix
- Path energy bounds for hub-centric graphs of order 2n + 1 with algorithmic computation
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)