Abstract
The energy of a graph T is the sum of the absolute values of the eigenvalues of the adjacency matrix of T. Seidel switching is an operation on the edge set of T. In some special cases Seidel switching does not change the spectrum, and therefore the energy. Here we investigate when Seidel switching changes the spectrum, but not the energy. We present an infinite family of examples with very large (possibly maximal) energy.The Seidel energy S(T) of is defined to be the sum of the absolute values of the eigenvalues of the Seidel matrix of G. It follows that S(T) is invariant under Seidel switching and taking complements. We obtain upper and lower bounds for S(T), characterize equality for the upper bound, and formulate a conjecture for the lower bound.
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.
