Normal Frequency method for finding the existence of maximum clique of the clique-complex

Determining the existence of $k$-clique in the arbitrary graph is one of the NP problems. We suggest a novel way to determine the existence of $k$-clique in the clique complex $G$ under specific conditions, by using the normal mode and eigenvector of the Laplace matrix of $G$.