Abstract
Given a graph [Formula: see text] with vertex set [Formula: see text], we associate to it a [Formula: see text] path matrix whose [Formula: see text] entry represents the maximum number of vertex disjoint path with the length [Formula: see text] from [Formula: see text] to [Formula: see text] for [Formula: see text] and [Formula: see text] if [Formula: see text]. The eigenvalues of this matrix are called the path eigenvalues of the graph. In this note, we investigate [Formula: see text] path energy of some classes of graphs and several results concerning [Formula: see text] path energy has been obtained.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
