Dominating Sets and Domination Polynomial of Wheels

Authors

  • Sahib Sh. Kahat
  • Abdul Jalil M. Khalaf Head of Mathematics Department Faculty of Mathematics and Computer Science University of Kufa Najaf
  • Roslam Roslan

Abstract

Let be a simple graph. set is a dominating set of , if every vertex in is adjacent to at least one vertex in . Let be wheel  with order n. Let be the family of dominating sets of a wheels with cardinality , and let . In this paper, we construct , and obtain a recursive formula for . Using this recursive formula, we consider the polynomial , which we call domination polynomial of wheels and obtain some properties of this polynomial.

References

S. Alikhani, Y. H. Peng, Dominating Sets and Domination Polynomial of Cycles, arXiv preprint arXiv:0905.3268 (2009).

S. Alikhani, Y. H. Peng, Dominating Sets and Domination Polynomial of Certain Graphs, II, Opuscula Mathematica 30, no. 1 (2010): 37-51.

.M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completness. Freeman, New York, 1979.

S. Sh. Kahat, A. M. Khalaf and Roslan Hasni, Dominating Sets and Domination Polynomial of stars, Australian Journal of Basic and Applied Sciences, June 2014.

T.W. Haynes, S.T. Hedetniemi, P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.

Downloads

Published

2014-06-15

How to Cite

Kahat, S. S., Khalaf, A. J. M., & Roslan, R. (2014). Dominating Sets and Domination Polynomial of Wheels. Asian Journal of Applied Sciences, 2(3). Retrieved from https://ajouronline.com/index.php/AJAS/article/view/1223

Issue

Vol. 2 No. 3 (2014): June 2014

Section

Articles

License

  • Papers must be submitted on the understanding that they have not been published elsewhere (except in the form of an abstract or as part of a published lecture, review, or thesis) and are not currently under consideration by another journal published by any other publisher.
  • It is also the authors responsibility to ensure that the articles emanating from a particular source are submitted with the necessary approval.
  • The authors warrant that the paper is original and that he/she is the author of the paper, except for material that is clearly identified as to its original source, with permission notices from the copyright owners where required.
  • The authors ensure that all the references carefully and they are accurate in the text as well as in the list of references (and vice versa).
  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Attribution-NonCommercial 4.0 International that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
  • The journal/publisher is not responsible for subsequent uses of the work. It is the author's responsibility to bring an infringement action if so desired by the author.