Abstract
The energy of a graph is defined as the sum of the absolute values of all eigenvalues of the graph. The subgraph grafting operation on a graph is a kind of subgraph moving between two vertices of the graph. In this paper, we introduce two new subgraph grafting operations on bipartite graph and show how the graph energy changes under these subgraph grafting operations. As the application of these operations, we determine the trees with the third and fourth minimal energies in the set of trees with given order and domination number.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.