Finding Cliques of a Graph using Prime Numbers

Abstract

This paper proposes a new algorithm for solving maximal cliques for simple undirected graphs using the theory of prime numbers. A novel approach using prime numbers is used to find cliques and ends with a discussion of the algorithm.

7 pages, 1 figure