Cayley graphs on cyclic groups of order (pqr)^2 with connecting sets consisting of prime-square-order elements are shown to be connected, Eulerian or Hamiltonian under stated conditions, and their clique, chromatic, independence numbers and diameter are computed.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Prime Square Order Cayley Graph of Cyclic Groups of Particular Valency
Cayley graphs on cyclic groups of order (pqr)^2 with connecting sets consisting of prime-square-order elements are shown to be connected, Eulerian or Hamiltonian under stated conditions, and their clique, chromatic, independence numbers and diameter are computed.