SEIDEL ENERGY OF GENERALIZED COMPLEMENTS OF GRAPHS

Let P = {Vi,V2, Vjt} be a partition of vertex set V of a graph G. The k— complement of G denoted by G% is defined as follows: for all Vi and Vj in P, i ^ j, remove the edges between Vi and Vj and add edges between Vi and Vj which are not in G. The graph G is k-self complementary with respect to P if G% = G. The k(i)-complement G^,^ of a graph G with respect to P is defined as follows: for all V, Sf, remove edges inside Vr and add edges which are not in Vr. Any graph G is k(i)-self complementary if G^^ = G. In this paper, we study Seidel energy of generalized complements of some families of graph. An effort is made to throw some light on showing variation in Seidel energy due to changes in a partition of the graph.