Sombor Indices of Prime Coprime Graph for Integer Modulo Group

  • Abdurahim Abdurahim(1)
    Universitas Mataram
  • Rio Satriyantara(2*)
    Universitas Mataram
  • Fariz Maulana(3)
    Universitas Mataram
  • I Gede Adhitya Wisnu Wardhana(4)
    Universitas Mataram
  • Nuzla Af’idatur Robbaniyyah(5)
    Universitas Mataram
    • (*) Corresponding Author
DOI: https://doi.org/10.35508/jd.v7i2.21120

Abstract

The prime coprime graph of integers modulo n is an ordered pair consisting of a set of vertices (integers modulo n) and edges. Two distinct vertices are said to be adjacent if the greatest common divisor (gcd) of their orders is either 1 or a prime number. This article discusses the prime coprime graph of integers modulo n for n = pq, where p < q are prime numbers. The results of the study include the degree characteristics of the vertices and the subgraphs formed. Additionally, the Sombor index of the graph is also determined.

Downloads

Download data is not yet available.

PlumX Metrics

Published
2025-11-01
How to Cite
1.
Abdurahim A, Satriyantara R, Maulana F, Wardhana IG, Robbaniyyah N. Sombor Indices of Prime Coprime Graph for Integer Modulo Group. JD [Internet]. 1Nov.2025 [cited 3Nov.2025];7(2):123-30. Available from: https://ejurnal.undana.ac.id/index.php/JD/article/view/21120
Issue
Vol 7 No 2 (2025): November 2025
Section
Articles

Copyright (c) 2025 Rio Satriyantara

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

 Creative Commons License This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

 Copyright is retained by the authors, and articles can be freely used and distributed by others.