We investigate graphs whose signless Laplacian matrix has three distinct eigenvalues. We show that the largest signless Laplacian eigenvalue of a connected graph G with three distinct signless Laplacian eigenvalues is noninteger if and only if G = K n − e for n ≥ 4, where K n − e is the n vertex complete graph with an edge removed. Moreover, examples of such graphs are given.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.