Table of Contents
ISRN Discrete Mathematics
Volume 2012 (2012), Article ID 852129, 6 pages
http://dx.doi.org/10.5402/2012/852129
Research Article

Some New Results on Global Dominating Sets

1Department of Mathematics, Saurashtra University, Rajkot 360005, India
2Department of Mathematics, A.V. Parekh Technical Institute, Rajkot 360002, India

Received 25 September 2012; Accepted 11 October 2012

Academic Editors: Q. Gu, U. A. Rozikov, and W. Wallis

Copyright © 2012 S. K. Vaidya and R. M. Pandit. 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. E. Sampathkumar, “The global domination number of a graph,” Journal of Mathematical and Physical Sciences, vol. 23, no. 5, pp. 377–385, 1989. View at Google Scholar · View at Zentralblatt MATH
  2. R. C. Brigham and R. D. Dutton, “Factor domination in graphs,” Discrete Mathematics, vol. 86, no. 1–3, pp. 127–136, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. V. Zverovich and A. Poghosyan, “On Roman, global and restrained domination in graphs,” Graphs and Combinatorics, vol. 27, no. 5, pp. 755–768, 2011. View at Publisher · View at Google Scholar
  4. T. N. Janakiraman, S. Muthammai, and M. Bhanumathi, “Global domination and neighborhood numbers in Boolean function graph of a graph,” Mathematica Bohemica, vol. 130, no. 3, pp. 231–246, 2005. View at Google Scholar · View at Zentralblatt MATH
  5. J. R. Carrington, Global domination of factors of a graph [Ph.D. thesis], University of Central Florida, 1992.
  6. J. R. Carrington and R. C. Brigham, “Global domination of simple factors,” in Proceedings of the 23rd Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1992), vol. 88, pp. 161–167, 1992. View at Zentralblatt MATH
  7. K. Kavitha and N. G. David, “Global domination upon edge addition stable graphs,” International Journal of Computer Applications, vol. 43, no. 19, pp. 25–27, 2012. View at Google Scholar
  8. V. R. Kulli and B. Janakiram, “The total global domination number of a graph,” Indian Journal of Pure and Applied Mathematics, vol. 27, no. 6, pp. 537–542, 1996. View at Google Scholar · View at Zentralblatt MATH
  9. S. C. Shee and Y. S. Ho, “The cordiality of the path-union of n copies of a graph,” Discrete Mathematics, vol. 151, no. 1–3, pp. 221–229, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. D. B. West, Introduction to Graph Theory, Prentice-Hall, New Delhi, India, 2003.
  11. 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.