Abstract
Let G be a simple undirected graph, and let S(G) be its Seidel matrix. The Seidel energy of G is defined as ES(G)=∑i=1n|λSi(G)|, where λS1(G),λS2(G),…,λSn(G) are Seidel eigenvalues of G. Recently, researchers have studied the effect of embedded edges on the distance energy of complete bipartite graphs. In this paper, the effect of perturbed edges on the Seidel energy of complete bipartite graphs and complete split graphs is studied. Finally, these graphs are ordered according to their Seidal energies.
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.
