Article ID Journal Published Year Pages File Type
421129 Discrete Applied Mathematics 2015 6 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Characterization of split graphs with at most four distinct eigenvalues
Authors
, ,