Prime Square Order Cayley Graph of Cyclic Groups of Particular Valency

TL;DR

This paper investigates the structural properties of Cayley graphs derived from cyclic groups of order equal to the square of a product of three distinct primes, focusing on connectivity, Eulerian and Hamiltonian properties, and key graph parameters.

Contribution

It provides a comprehensive analysis of these specific Cayley graphs, highlighting their structural characteristics and key parameters, which was previously unexplored.

Findings

Analyzed connectivity, Eulerian, and Hamiltonian properties of the graphs.

Determined key graph parameters such as clique number, chromatic number, independence number, and diameter.

Abstract

As a vital link between group theory and graph theory, Cayley graphs provide a geometric framework for encoding algebraic structures. This study explores the properties of Cayley graphs derived from cyclic groups whose order is the square of the product of three distinct prime numbers. We specifically examine cases where the connecting set is defined by the collection of all elements with an order equal to the square of a prime. A comprehensive analysis of these graphs is presented, focusing on structural characteristics such as connectivity, Eulerian properties, and Hamiltonicity. Furthermore, we determine several key graph parameters, including the clique number, chromatic number, independence number, and diameter.