Abstract
Given a graph G, we associate to it 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 Shikare et al. (2018) 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.
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.
