Normal Frequency method for finding the existence of maximum clique of the clique-complex
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.