The Domination Number of the,Co-prime Power Order, Graph of a Finite Groups
DOI:
https://doi.org/10.32792/jeps.v16i1.792Abstract
Suppose that is a group with . The co-prime power order graph of denoted by is defined as a graph with vertex set , where two ,distinct elements are adjacent if and only if , where is a prime integer number divides ,. In this study we determine the dominating set and the dominating number of graph when is a finite.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Journal of Education for Pure Science
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
The Authors understand that, the copyright of the articles shall be assigned to Journal of education for Pure Science (JEPS), University of Thi-Qar as publisher of the journal.
Copyright encompasses exclusive rights to reproduce and deliver the article in all form and media, including reprints, photographs, microfilms and any other similar reproductions, as well as translations. The reproduction of any part of this journal, its storage in databases and its transmission by any form or media, such as electronic, electrostatic and mechanical copies, photocopies, recordings, magnetic media, etc. , will be allowed only with a written permission from Journal of education for Pure Science (JEPS), University of Thi-Qar.
Journal of education for Pure Science (JEPS), University of Thi-Qar, the Editors and the Advisory International Editorial Board make every effort to ensure that no wrong or misleading data, opinions or statements be published in the journal. In any way, the contents of the articles and advertisements published in the Journal of education for Pure Science (JEPS), University of Thi-Qar are sole and exclusive responsibility of their respective authors and advertisers.
