Abstract
If there is an adjacency matrix A, the sum total of the singular values of A is known as the graph energy. We can find the change in energy of a graph by removing the edges using the inequality theorem on singular values. In this paper we discuss about the change in semigraph energy due to deletion of edges and its relation with distance energy
Sign-in/Register to access full text options 
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.
