Abstract
Haemers' conjecture on the Seidel energy of graphs, states that the energy of the Seidel matrix of any graph of order n is at least 2n−2, where the equality holds for the complete graph. In this paper, we give a short simple proof of this conjecture.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
