Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2009, Article ID 542040, 10 pages
Research Article

Dominating Sets and Domination Polynomials of Paths

1Department of Mathematics, Faculty of Science, Yazd University, 89195-741, Yazd, Iran
2Institute for Mathematical Research, University Putra Malaysia, 43400 UPM Serdang, Malaysia
3Department of Mathematics, University Putra Malaysia, 43400 UPM Serdang, Malaysia

Received 13 November 2008; Accepted 12 March 2009

Academic Editor: Alexander Rosa

Copyright © 2009 Saeid Alikhani and Yee-Hock Peng. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs, vol. 208 of Monographs and Textbooks in Pure and Applied Mathematics, Marcel Dekker, New York, NY, USA, 1998. View at Zentralblatt MATH · View at MathSciNet
  2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Series of Books in the Mathematical Science, W. H. Freeman, San Francisco, Calif, USA, 1979. View at Zentralblatt MATH · View at MathSciNet
  3. S. Alikhani and Y. H. Peng, “Introduction to domination polynomial of a graph,” to appear in Ars Combinatoria.
  4. G. Chartrand and P. Zhang, Introduction to Graph Theory, McGraw-Hill, Boston, Mass, USA, 2005. View at Zentralblatt MATH