On the path energy of some graphs
Abstract
Let G be a graph with vertex set V(G) = {v1, v2, ..., vn}. We define a matrix whose (i, j)^th entry is the maximum number of vertex disjoint paths between the corresponding vertices if they are adjacent and is zero otherwise. We call this matrix as path matrix of G and its eigenvalues as path eigenvalues of G. In this paper, we investigate path eigenvalues and path energy of some graphs.
Copyright © 2020 S. C. Patekar, M. M. Shikare. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
S. C. Patekar, M. M. Shikare, On the path energy of some graphs, J. Math. Comput. Sci. 10 (2020), 535–543. https://doi.org/10.28919/jmcs/4460
BibTeX
@article{Patekar2020,
author = {Patekar, S. C. and Shikare, M. M.},
title = {On the path energy of some graphs},
journal = {J. Math. Comput. Sci.},
volume = {10},
year = {2020},
pages = {535--543},
doi = {10.28919/jmcs/4460}
}