On the Domination Numbers of Certain Prism Graphs
DOI:
https://doi.org/10.25130/tjps.v27i1.85الكلمات المفتاحية:
Dominating set, Domination number, Prism graphالملخص
A dominating set S of a graph , is a subset of the vertex set V (G) such that any vertex not in S is adjacent to at least one vertex in S .The domination number of a graph G denoted by is the minimum size of the dominating sets of G. In this paper we introduced the domination numbers of certain prism graphs.
التنزيلات
منشور
كيفية الاقتباس
الرخصة
الحقوق الفكرية (c) 2022 Tikrit Journal of Pure Science
هذا العمل مرخص بموجب Creative Commons Attribution 4.0 International License.
Tikrit Journal of Pure Science is licensed under the Creative Commons Attribution 4.0 International License, which allows users to copy, create extracts, abstracts, and new works from the article, alter and revise the article, and make commercial use of the article (including reuse and/or resale of the article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made, and the licensor is not represented as endorsing the use made of the work. The authors hold the copyright for their published work on the Tikrit J. Pure Sci. website, while Tikrit J. Pure Sci. is responsible for appreciate citation of their work, which is released under CC-BY-4.0, enabling the unrestricted use, distribution, and reproduction of an article in any medium, provided that the original work is properly cited.
