The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. Some variants of energy can also be found in the literature, in which the energy is defined for the Laplacian matrix, Distance matrix, Common-neighbourhood matrix or Seidel matrix. The Seidel matrix of the graph G is the square matrix in which ij^th entry is −1 or 1, if the vertices v_i and v_j are adjacent or non-adjacent respectively, and is 0, if v_i = v_j. The Seidel energy of G is the sum of the absolute values of the eigenvalues of its Seidel matrix. We present here some families of pairs of graphs whose Seidel matrices have different eigenvalues, but who have the same Seidel energies.