CONNECTIVITY INDICES OF POWER GRAPH OVER DIHEDRAL GROUPS D2pq

Authors

  • Arif Munandar UIN Sunan Kalijaga Yogayakarta

DOI:

https://doi.org/10.25077/jmua.15.4.515-526.2026

Keywords:

Power Graph, Dihedral Group, Connectivity Indices

Abstract

The dihedral group, fundamentally characterized by its rotational and reflectional symmetries, serves as an intriguing object of study when represented as a graph. Recently, the study of power graphs and their topological indices has gained significant attention in algebraic graph theory. In this study, we investigate the structural properties of the undirected power graph over the dihedral group D2n specifically for the composite order n=pq, where p and q are distinct odd primes. By determining the precise vertex degrees and connectivity patterns within the graph, this paper mathematically derives the exact formulas for five prominent connectivity indices: the first Zagreb index, the Wiener index, the hyper-Wiener index, the Harary index, and the Forgotten index. The results provide a deeper understanding of how the interplay between symmetry elements and the product of two distinct primes influences the topological descriptors of the associated power graph.

Downloads

Download data is not yet available.

References

[1] Kelarev, A. V., & Quinn, S. J. (2000). A combinatorial property and power graph of groups. Contributions to General Algebra, 12, 3-6.

[2] Kelarev, A. V., & Quinn, S. J. (2002). Directed graphs and combinatorial properties of semigroups. Journal of Algebra, 251, 16-26. DOI: https://doi.org/10.1006/jabr.2001.9128

[3] Chakrabarty, I., Ghosh, S., & Sen, M. K. (2009). Undirected power graph of semigroups. Semigroup Forum, 78, 410-426. DOI: https://doi.org/10.1007/s00233-008-9132-y

[4] Ali, F., Fatima, S., & Wang, W. (2022). On the power graphs of certain finite groups. Linear and Multilinear Algebra, 70, 3803-3817. DOI: https://doi.org/10.1080/03081087.2020.1856028

[5] Panda, R. P., & Dalal, S. S. (2023). On the structure of power graphs of finite groups. Journal of Algebraic Combinatorics.

[6] Cameron, P. J., & Jafari, S. H. (2020). On the connectivity and independence number of power graph of groups. Graphs and Combinatorics, 36, 895-904. DOI: https://doi.org/10.1007/s00373-020-02162-z

[7] Cameron, P. J., Guerra, H., & Jurina, S. (2019). The power graph of a torsion-free group. Journal of Algebraic Combinatorics, 49, 83-98. DOI: https://doi.org/10.1007/s10801-018-0819-1

[8] Parveen, S., & Kaur, M. (2024). Topological indices of certain power graphs. Discrete Applied Mathematics.

[9] Trinajstic, N. (1987). Mathematical and computational concepts in chemistry. Journal of Molecular Structure: THEOCHEM, 152. DOI: https://doi.org/10.1016/0166-1280(87)80078-7

[10] Wiener, H. (1947). Structural determination of paraffin boiling points. Journal of the American Chemical Society, 69, 17-20. DOI: https://doi.org/10.1021/ja01193a005

[11] Furtula, B., & Gutman, I. (2015). A forgotten topological index. Journal of Mathematical Chemistry, 53, 1184-1190. DOI: https://doi.org/10.1007/s10910-015-0480-z

[12] Gutman, I. (2023). New applications of the forgotten topological index in chemistry. MATCH Communications in Mathematical and in Computer Chemistry, 89.

[13] Zahidah, S., Mahanani, D. M., & Oktaviana, K. L. (2021). Connectivity indices of coprime graph of generalized quaternion group. Journal of the Indonesian Mathematical Society, 27, 285-296. DOI: https://doi.org/10.22342/jims.27.3.1043.285-296

[14] Munandar, A., & Rizki, A. T. (2025). Connectivity indices of coprime graphs over generalized quaternion groups of a certain order. Jurnal Matematika, Statistika dan Komputasi, 22(1), 16-27. DOI: https://doi.org/10.20956/j.v22i1.44253

[15] Munandar, A. (2025). Connectivity indices of power graphs over dihedral groups of a certain order. Jurnal Sains Dasar, 14, 14-22. DOI: https://doi.org/10.21831/jsd.v14i1.89329

[16] Munandar, A. (2022). Pengantar matematika diskrit dan teori graf. Deepublish.

[17] Gallian, J. A. (2021). Contemporary abstract algebra. Chapman and Hall/CRC. DOI: https://doi.org/10.1201/9781003142331

[18] Shofiyulloh, M., Munandar, A., & Wardhati, K. (2024). Graf prima koprima atas grup dihedral. Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP), 16(2), 133-146. DOI: https://doi.org/10.20884/1.jmp.2024.16.2.13868

[19] Das, K. C., Xu, K., & Nam, J. (2015). Zagreb indices of graphs. Frontiers of Mathematics in China, 10, 567-582. DOI: https://doi.org/10.1007/s11464-015-0431-9

[20] Dobrynin, A., Entringer, R. C., & Gutman, I. (2001). Wiener index of trees: Theory and applications. Acta Applicandae Mathematica, 66, 211-249. DOI: https://doi.org/10.1023/A:1010767517079

[21] Yu, G., Ren, L., & Li, X. (2019). Wiener index, hyper-Wiener index, Harary index and Hamiltonicity properties of graphs. Applied Mathematics: A Journal of Chinese Universities, 34, 162-172. DOI: https://doi.org/10.1007/s11766-019-3565-9

[22] Xu, K., & Das, K. C. (2011). On Harary index of graphs. Discrete Applied Mathematics, 159, 1631-1640. DOI: https://doi.org/10.1016/j.dam.2011.06.003

[23] Zhou, B., & Trinajstic, N. (2008). On Harary index. Journal of Mathematical Chemistry, 44, 611-618. DOI: https://doi.org/10.1007/s10910-007-9339-2

Downloads

Published

22-10-2026

How to Cite

Munandar, A. (2026). CONNECTIVITY INDICES OF POWER GRAPH OVER DIHEDRAL GROUPS D2pq. Jurnal Matematika UNAND, 15(4), 515–526. https://doi.org/10.25077/jmua.15.4.515-526.2026

Issue

Vol. 15 No. 4 (2026)

Section

Articles

License

Copyright (c) 2026 Departemen Matematika dan Sains Data FMIPA UNAND

Creative Commons License

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

All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA 4.0). This license allows published content to be freely accessed, shared, redistributed, and adapted for any purpose, including commercial use, provided that the applicable license conditions are followed.

Copyright Holder

The copyright of articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND), in accordance with the journal's stated copyright policy.

Author Rights

Under the CC BY-SA 4.0 license, authors may share, distribute, and reuse their published articles, subject to the applicable license conditions. These rights include:

  • Self-Archiving: Authors may deposit their published articles in institutional repositories, personal websites, or academic platforms.

  • Reuse: Authors may reuse their published work in subsequent publications, research, teaching materials, or other lawful purposes, provided that appropriate attribution is maintained.

  • Distribution: Authors may share and distribute their published articles without requiring additional permission under the terms of the license.

Creative Commons License (CC BY-SA 4.0)

Under the CC BY-SA 4.0 license, users are free to:

  • Share: Copy and redistribute the material in any medium or format.

  • Adapt: Remix, transform, and build upon the material for any purpose, including commercial purposes.

These permissions are subject to the following conditions:

  • Attribution: Users must give appropriate credit to the original author(s), retain relevant copyright notices, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author(s), copyright holder, or journal.

  • ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same CC BY-SA 4.0 license or a compatible license.

  • No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from exercising the rights granted by the license.

For more information about the CC BY-SA 4.0 license, please visit:

https://creativecommons.org/licenses/by-sa/4.0/

Third-Party Content

Third-party materials, including figures, tables, photographs, and illustrations, are covered by the article's CC BY-SA 4.0 license only when their inclusion under that license is authorized.

Materials excluded from the license must be clearly identified with appropriate copyright notices and attribution. Authors are responsible for obtaining any necessary permissions, while users must comply with the applicable licensing terms or permissions when reusing excluded materials.

Copyright and Licensing Information

Copyright and licensing information should be clearly displayed on each published article's landing page and included in the full-text versions (HTML and PDF), where applicable, to ensure transparency regarding copyright ownership and permitted reuse.