Abstract
A graph whose vertex set can be partitioned into the disjoint union of an independent set and a clique is called split graph. A complete split graph is one that all vertices of independent set are adjacent with the vertices of the clique. In this paper, all split graphs with at most four distinct eigenvalues are characterized.
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.
