Melola Discovery

← Melola Discovery

Akses terbuka Jurnal

Connectivity Indices of Coprime Graphs over Generalized Quaternion Groups of a Certain Order

Jurnal Matematika, Statistika dan Komputasi · Vol. 22 No. 1 (2025) · hlm. 16–27

DOI
10.20956/j.v22i1.44253
ISSN
2614-8811, 1858-1382
Terbit
2025-09-08
Penerbit
Department of Mathematics, Hasanuddin University
Bahasa
en
Lisensi
creativecommons.org/licenses/by/4.0

Abstrak

The generalized quaternion group is a non-abelian group of order that exhibits certain structural similarities with the dihedral group. It is generated by two elements that satisfy specific defining relations. Meanwhile, a coprime graph is constructed by representing the elements of a group as vertices, where two vertices are adjacent if the orders of the corresponding elements are coprime. In this study, we investigate coprime graphs derived from generalized quaternion groups, particularly when the group order is given by, with being a prime number. Based on the structural properties of these graphs, we compute several connectivity indices, including the First and Second Zagreb indices, the Wiener index, the hyper-Wiener index, the Harary index, and the Szeged index.

Kata kunci

Jaringan kolaborasi para penulis

3 penulis · 2 tautan kepenulisan bersama · 1 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Sunan Kalijaga State Islamic University Yogyakarta
  • Universitas Islam Negeri Ar-Raniry
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Muslim DjunedUniversitas Islam Negeri Ar-Raniry1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unhas.ac.id/index.php/jmsk/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">Connectivity Indices of Coprime Graphs over Generalized Quaternion Groups of a Certain Order</dc:title>
	<dc:creator xml:lang="en">Munandar, Arif</dc:creator>
	<dc:creator xml:lang="en">Rizki, Aulia Tiffany</dc:creator>
	<dc:subject xml:lang="en">Connectivity Index</dc:subject>
	<dc:subject xml:lang="en">Coprime graph</dc:subject>
	<dc:subject xml:lang="en">Generalizeq Quaternion Group</dc:subject>
	<dc:description xml:lang="en">The generalized quaternion group is a non-abelian group of order  that exhibits certain structural similarities with the dihedral group. It is generated by two elements that satisfy specific defining relations. Meanwhile, a coprime graph is constructed by representing the elements of a group as vertices, where two vertices are adjacent if the orders of the corresponding elements are coprime. In this study, we investigate coprime graphs derived from generalized quaternion groups, particularly when the group order is given by , with  being a prime number. Based on the structural properties of these graphs, we compute several connectivity indices, including the First and Second Zagreb indices, the Wiener index, the hyper-Wiener index, the Harary index, and the Szeged index.</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2025-09-08</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unhas.ac.id/index.php/jmsk/article/view/44253</dc:identifier>
	<dc:identifier>10.20956/j.v22i1.44253</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 22 No. 1 (2025): SEPTEMBER 2025; 16-27</dc:source>
	<dc:source>2614-8811</dc:source>
	<dc:source>1858-1382</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://journal.unhas.ac.id/index.php/jmsk/article/view/44253/13324</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2025 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
	<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>