Characterization of split graphs with at most four distinct eigenvalues

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.