Seidel Switching and Graph Energy
AbstractAbstract: The energy of a graph Γ is the sum of the absolute values of the eigenvalues of the adjacency matrix of Γ. Seidel switching is an operation on the edge set of Γ. 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(Γ) of Γ is defined to be the sum of the absolute values of the eigenvalues of the Seidel matrix of G. It follows that S(Γ) is invariant under Seidel switching and taking complements. We obtain upper and lower bounds for S(Γ), characterize equality for the upper bound, and formulate a conjecture for the lower bound.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2012-023.
Date of creation: 2012
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
Seidel switching; Seidel matrix; graph spectra; graph energy.;
Find related papers by JEL classification:
- C0 - Mathematical and Quantitative Methods - - General
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.