Abstract
Let G be a graph. The energy of G, , is defined as the sum of absolute values of its eigenvalues. Here, it is shown that if G is a graph and is an edge partition of G, such that are spanning; then if and only if , for every and , where is the adjacency matrix of . It was proved that if G is a graph and are subgraphs of G which partition edges of G, then . In this paper we show that if G is connected, then the equality is strict, that is .
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.
