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

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.

Authors

Publication Details

Journal
Jurnal Matematika Statistika dan Komputasi
Published
2025-09-08
DOI
https://doi.org/10.20956/j.v22i1.44253
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Arif Munandar, Aulia Tiffany Rizki
Jurnal Matematika Statistika dan Komputasi
Graph theory and applications
article

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

Arif Munandar, Aulia Tiffany Rizki
article en

Abstract

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.

Jurnal Matematika Statistika dan KomputasiVol. 22(1)
Openalex Percentile: Top 69%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.