On the Domination Numbers of Certain Prism Graphs

Article Sidebar

pdf
Published: Dec 2, 2022
DOI: https://doi.org/10.25130/tjps.v27i1.85
Keywords:
Dominating set, Domination number, Prism graph

Main Article Content

Ayhan Ahmed Al-Shumam

Abstract

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.

Article Details

How to Cite
Ayhan Ahmed Al-Shumam. (2022). On the Domination Numbers of Certain Prism Graphs. Tikrit Journal of Pure Science, 27(1), 90–98. https://doi.org/10.25130/tjps.v27i1.85
Issue
Vol. 27 No. 1 (2022)
Section
Articles
Creative Commons License

This work is licensed under a 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.

References

[1] Chartrand G. and Lesniak L. (1996). Graphs and Digraphs. Third Edition. Chapman and Hall.

[2] Haynes T. W. Hedetniemi S. T. and Slater P. J. (1998). Fundamentals of Domination in Graphs. Marcel Dekker. New York-Basel-Hong Kong.

[3] Hedetniemi S. T. and Laskar R. C. (1991). Topics on domination. North Holland.

[4] Gayathri B., (2011). Connected Co-Independent Domination of a Graph. Int. Contemp. Sciences, 6: 423-429.

[5] Zmazek B. and Žerovnik J. (2005). On Domination Numbers of Graph Bundles. Institute of mathematics. physics & mechanics, Preprint series, 43:1-10.

[6] Khalil A. A. and Khalil O. A. (2010). Determination and Testing the Domination Numbers of Tadpole Graph, Book Graph and Stacked Book Graph Using MATLAB. College of Basic Education Researcher's Journal, 10(1):491-504.

[7] Alithani S., Peng Y. H. and Atan K. A. M.(2008). On The Domination Number of Some Graphs. Int. Math. Forum, 3(37-40): 1879-1884.

[8] Khalil A. A. (2011). Determination and Testing the Domination Numbers of Helm Graph, Web Graph and Levi Graph Using MATLAB. Journal of Education and Science, 24(2): 103-116.

[9] Xu G. and Kang L. (2011). On the Power Domination Number of the Generalized Petersen Graphs. Springer Science, Business Media, 22: 282–291.

[10] Chang G. J. (1998). Algorithmic Aspects of Domination in Graphs. Handbook of Combinatorial Optimization. Department of Applied Mathematics. National Chiao Tung University, Taiwan.

Available at:

http://citeseerx.ist.psu/viewdoc/summary?doi=10.1.1.116.6199.

[11] Weisstein Eric W. (1999). Prism Graph. From Math World-A Wolfram Wolfram Research, Inc. Available at:

http://www.mathworld.wolfram.com/PrismGraph.html.

[12] Mojdeh D. A. and Ghameshlou A. N. (2007). Domination in Jahangir Graph