Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : EIGEN MATHEMATICS JOURNAL

Hyper-Wiener and Szeged Indices of non-Coprime Graphs of Modulo Integer Groups Ghoffari, Lalu Hasan; Wardhana, I Gede Adhitya Wisnu; Dewi, Putu Kartika; Suparta, I Nengah
Eigen Mathematics Journal Vol 8 No 1 (2025): June
Publisher : University of Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/emj.v8i1.244

Abstract

The non-coprime graph of the integer modulo group is a graph whose vertices represent the elements of the integer modulo group, excluding the identity element. Two distinct vertices are adjacent if and only if their orders are not relatively prime. This study explores two topological indices, the Hyper-Wiener index and the Szeged index, in the non-coprime graph of the integer modulo-n group. The results reveal that these indices are equal when the order is a prime power but differ when the order is the product of two distinct prime numbers. This research provides new insights into the patterns and characteristics of these indices, contributing to a broader understanding of the application of graph theory to abstract group structures.
Algebraic Structures and Combinatorial Properties of Unit Graphs in Rings of Integer Modulo with Specific Orders Lestari, Sahin Two; Dewi, Putu Kartika; Wardhana, I Gede Adhitya Wisnu; Suparta, I Nengah
Eigen Mathematics Journal Vol 7 No 2 (2024): December
Publisher : University of Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/emj.v7i2.235

Abstract

Unit graph is the intersection of graph theory and algebraic structure, which can be seen from the unit graph representing the ring modulo n in graph form. Let R be a ring with nonzero identity. The unit graph of R, denoted by G(R), has its set of vertices equal to the set of all elements of R; distinct vertices x and y are adjacent if and only if x + y is a unit of R. In this study, the unit graph, which is in the ring of integers modulo n, denoted by G(Zn). It turns out when n is 2^k, G(Zn) forms a complete bipartite graph for k∈N, whereas when n is prime, G(Zn) forms a complete (n+1)/2-partites graph. Additionally, the numerical invariants of the graph G(Zn), such as degree, chromatic number, clique number, radius, diameter, domination number, and independence number complement the characteristics of G(Zn) for further research.