Table of Contents
International Journal of Combinatorics
Volume 2013, Article ID 795401, 4 pages
http://dx.doi.org/10.1155/2013/795401
Research Article

Some New Results on Distance -Domination in Graphs

1Department of Mathematics, Saurashtra University, Rajkot, Gujarat 360005, India
2B. H. Gardi College of Engineering & Technology, P.O. Box 215, Rajkot, Gujarat 360001, India

Received 17 August 2013; Revised 9 December 2013; Accepted 11 December 2013

Academic Editor: Toufik Mansour

Copyright © 2013 Samir K. Vaidya and Nirang J. Kothari. 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. R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, Springer, 2nd edition, 2012. View at Publisher · View at Google Scholar
  2. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, NY, USA, 1998.
  3. P. J. Slater, “R-domination in graphs,” Journal of Association for Computer Machinery, vol. 23, no. 3, pp. 446–450, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  4. M. A. Henning, O. R. Swart, and H. C. Swart, “Bounds on distance domination parameters,” Journal of Combinatorics, Information and System Sciences, vol. 16, pp. 11–18, 1991. View at Google Scholar · View at Zentralblatt MATH
  5. J. R. Griggs and J. P. Hutchinson, “On the r-domination number of a graph,” Discrete Mathematics, vol. 101, pp. 65–72, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. N. Sridharan, V. S. A. Subramanian, and M. D. Elias, “Bounds on the distance two-domination number of a graph,” Graphs and Combinatorics, vol. 18, no. 3, pp. 667–675, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. J. Topp and L. Volkmann, “On packing and covering numbers of graphs,” Discrete Mathematics, vol. 96, no. 3, pp. 229–238, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  8. J. Wu and H. Li, “Domination and its application in Ad Hoc wireless networks with unidirectional links,” in Proceedings of the 2000 International Conference on Parallel Processing, pp. 189–197, 2000. View at Publisher · View at Google Scholar
  9. M. A. Henning, “Distance domination in graphs,” in Domination in Graphs: Advanced, Topics, T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Eds., pp. 321–349, Marcel Dekker, New York, NY, USA, 1998. View at Google Scholar