Exploring the Structural and Traversal Properties of Total Graphs over Finite Rings

This paper extends the concept of the total graph TΓ(R) associated with a commutative ring to the three-fold Cartesian product R=Zn×Zm×Zp, where n,m,p>1. We present complete and self-contained proofs for a wide range of graph-theoretic properties of TΓ(R), including connectivity, diameter, regularity conditions, clique and independence numbers, and exact criteria for Hamiltonicity and Eulericity. We also derive improved lower bounds for the genus and characterize the automorphism group in both general and symmetric cases. Each result is illustrated through concrete numerical examples for clarity. Beyond theoretical contributions, we discuss potential applications in cryptographic key-exchange systems, fault-tolerant network architectures, and algebraic code design. This work generalizes and deepens prior studies on two-factor total graphs, and establishes a foundational framework for future exploration of higher-dimensional total graphs over finite commutative rings.