Seidel energy of some large graphs

The Seidel energy of a simple graph $G$ is the sum of the absolute values of the eigenvalues of the Seidel matrix of $G$. In this paper, we construct some large graphs using graph operations like lexicographic product, corona and join operations on regular graphs and study their spectra and energy. As a consequence of this, we obtain seidel energy of particular graphs like $C_n [K_m], ~K_n [C_m], ~C_n [C_m] , ~K_n [K_m], ~C_n [Cay(Z_m; U_m)],\\ ~K_n [Cay(Z_m; U_m)], ~C_n\circ Cay(Z_m; U_m), ~K_n\circ Cay(Z_m; U_m), ~C_n\circ N_m, ~C_n\circ K_m, ~C_n\circ C_m,\\ ~K_n\circ K_m, ~W_{1, m}, ~W_{m, n}, ~W_{m+1}^n .$ By applying the above operations, we construct new classes of non co-spectral seidel equienergetic graphs.