Abstract
The distance matrix, distance eigenvalue, and distance energy of a connected graph have been studied intensively in the literature. We propose a new problem of studying how the distance energy changes when an edge is deleted. In this paper, we prove that the distance energy of a complete bipartite graph is always increased when an edge is deleted.
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.
