Effects on Seidel energy of two special types of graphs by perturbing edges

Abstract

Let $G$ be a simple undirected graph, and let $S\left(G\right)$ be its Seidel matrix. The Seidel energy of $G$ is defined as $E_S\left(G\right)={\sum }_{i=1}^n\left|{\lambda }_{S_i}\left(G\right)\right|$, where ${\lambda }_{S_1}\left(G\right),{\lambda }_{S_2}\left(G\right),\dots ,{\lambda }_{S_n}\left(G\right)$ 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.