Abstract
A graph is S-integral (or Seidel integral) if the spectrum of its Seidel matrix consists entirely of integers. In this paper, we give a sufficient and necessary condition for complete r-partite graphs to be S-integral, from which we construct infinitely many new classes of S-integral graphs. We also present an upper bound and a lower bound for the smallest S-eigenvalue (or Seidel eigenvalue) of a complete multipartite graph.
Sign-in/Register to access full text options 
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.
