Claim Missing Document
Check
Articles

Found 3 Documents
Search

Indeks Topologi Padmakar Ivan dan Szeged pada Graf Koprima Prima dari Grup Bilangan Bulat Modulo Abdurahim, Abdurahim; Pratiwi, Lia Fitta; Karang, Gusti Yogananda; Wardhana, I Gede Adhiya Wisnu; Irwansyah, Irwansyah; Awanis, Zatta Yumni; Romdhini, Mamika Ujianita
Square : Journal of Mathematics and Mathematics Education Vol. 6 No. 2 (2024)
Publisher : UIN Walisongo Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21580/square.2024.6.2.22836

Abstract

The Prime Coprime Graph is defined as a graph in which two distinct vertices are adjacent if and only if the greatest common divisor of their orders is 1, indicating that they are coprime. This research focuses on deriving general formulas for the Padmakar-Ivan index and the Szeged index for the coprime prime graph of the modulo integer group with n=p^k, where p is a prime number and k is not less than 2. As a result of this study, explicit formulas for the Padmakar-Ivan and Szeged indices were obtained, along with an analysis of the relationship between these two indices.Keywords: prime coprime graph, Padmakar-Ivan index, Szeged index.
THE INTERSECTION GRAPH REPRESENTATION OF A DIHEDRAL GROUP WITH PRIME ORDER AND ITS NUMERICAL INVARIANTS Ramdani, Dewi Santri; Wardhana, I Gede Adhitya Wisnu; Awanis, Zatta Yumni
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 16 No 3 (2022): BAREKENG: Journal of Mathematics and Its Applications
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (357.019 KB) | DOI: 10.30598/barekengvol16iss3pp1013-1020

Abstract

One of the concepts in mathematics that developing rapidly today is Graph Theory. The development of Graph Theory has been combined with Group Theory, that is by representing a group in a graph. The intersection graph from group , noted by , is a graph whose vertices are all non-trivial subgroups of group and two distinct vertices are adjacent in if and only if . In this research the intersection graph of a Dihedral group, we looking for the shapes and numerical invariants. The results obtained are if for , then has a subgraphs and subgraphs , the girth of the graph is 3, radius and diameter of the graph in a row is 2 and 3, and the chromatic number of the graph is
Indeks Topologi Padmakar Ivan dan Szeged pada Graf Koprima Prima dari Grup Bilangan Bulat Modulo Abdurahim, Abdurahim; Pratiwi, Lia Fitta; Karang, Gusti Yogananda; Wardhana, I Gede Adhiya Wisnu; Irwansyah, Irwansyah; Awanis, Zatta Yumni; Romdhini, Mamika Ujianita
Square : Journal of Mathematics and Mathematics Education Vol. 6 No. 2 (2024)
Publisher : UIN Walisongo Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21580/square.2024.6.2.22836

Abstract

The Prime Coprime Graph is defined as a graph in which two distinct vertices are adjacent if and only if the greatest common divisor of their orders is 1, indicating that they are coprime. This research focuses on deriving general formulas for the Padmakar-Ivan index and the Szeged index for the coprime prime graph of the modulo integer group with n=p^k, where p is a prime number and k is not less than 2. As a result of this study, explicit formulas for the Padmakar-Ivan and Szeged indices were obtained, along with an analysis of the relationship between these two indices.Keywords: prime coprime graph, Padmakar-Ivan index, Szeged index.