Algorithmic and Theoretical Approaches to Domination and Independence in Proper Power Graphs
Boletim da Sociedade Paranaense de Matemática · 16.06.2026 · 44 (8) · 1-14
DOI: 10.5269/bspm.83831 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 16.06.2026. Verfasst von Dhawlath G und 1 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This paper investigates graph parameters of power graphs for finite abelian groups. The power graph P(G) of a group G has an edge between two elements if one is a power of the other. We first establish a combinatorial formula for the number of elements of each order in a finite abelian group, leading to an efficient Python-based algorithm for its computation. Using this, we derive sharp bounds for the independence number of the power graph of a finite abelian p-group. We also prove that for any finite group, the independence number remains unchanged upon removing the identity element, meaning $\alpha(P(G)) = \alpha(P^*(G))$. Finally, our study is extended to provide new results on the domination and independent domination numbers for finite abelian p-groups.
Zitieren
APA
G, D., & V, R. (2026). Algorithmic and Theoretical Approaches to Domination and Independence in Proper Power Graphs. Boletim da Sociedade Paranaense de Matemática, 44(8), 1-14. https://doi.org/10.5269/bspm.83831
Vancouver
G D, V R. Algorithmic and Theoretical Approaches to Domination and Independence in Proper Power Graphs. Boletim da Sociedade Paranaense de Matemática. 2026;44(8):1-14. doi:10.5269/bspm.83831
BibTeX
@article{G2026,
author = {G, Dhawlath and V, Raja},
title = {Algorithmic and Theoretical Approaches to Domination and Independence in Proper Power Graphs},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2026},
volume = {44},
number = {8},
pages = {1--14},
doi = {10.5269/bspm.83831}
}
EUVIMED