Finding Cliques of a Graph using Prime Numbers

TL;DR

This paper introduces a novel prime number-based algorithm for identifying maximal cliques in simple undirected graphs, offering a new mathematical approach to a classic graph problem.

Contribution

The paper presents a new prime number-based algorithm for finding maximal cliques, combining number theory with graph algorithms.

Findings

Algorithm successfully finds maximal cliques in test graphs.

Prime number approach offers a new perspective on clique detection.

Discussion highlights potential advantages and limitations.

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.