On the Seidel Laplacian spectrum of threshold graphs

A graph which does not contain C۴, P۴, or ۲K۲ as its induced subgraphs, is called a threshold graph. In this paper, we consider seidel laplacian matrix of a connected threshold graph and determine the seidel laplacian spectrum. Also, the characterization of threshold graphs having atmost four distinct seidel laplacian eigenvalues have been computed.

کلیدواژه ها:

Threshold graph ، Pineapple graph ، Seidel Laplacian matrix ، Equitable partition matrix