Some results on global dominating sets


  • S. K. Vaidya Saurashtra University.
  • R. M. Pandit A. V. Parekh Technical Institute.



Duplication of a vertex, Dominating set, Global dominating set.


A dominating set is called a global dominating set if it is a dominating set for a graph G and its complement G. We investigate some general results for global dominating sets corresponding to the graphs Pn, Cn and Wn.

Author Biographies

S. K. Vaidya, Saurashtra University.

Department of Mathematics Saurashtra University Rajkot-360005 Gujarat.

R. M. Pandit, A. V. Parekh Technical Institute.

Department of Mathematics A. V. Parekh Technical Institute, Rajkot-360002 Gujarat.


[1] R. C. Brigham and R. D. Dutton, Factor domination in graphs, Discrete Mathematics, 86, pp. 127-136, (1990).

[2] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Monographs and Textbooks in Pure and Applied Mathematics, Marcel Dekker, Inc., New York, (1998).

[3] V. R. Kulli and B. Janakiram, The total global domination number of a graph, Indian Journal of Pure and Applied Mathematics, 27, pp. 537-542, (1996).

[4] E. Sampathkumar, The global domination number of a graph, J. Math. Phys.Sci., 23, pp. 377-385, (1989).

[5] S. K. Vaidya and R. M. Pandit, Some new results on global dominating sets, ISRN Discrete Mathematics,vol. 2012, Article ID 852129, 6 pages, 2012. doi: 10.5402/2012/852129.

[6] D. B. West, Introduction to Graph Theory, Prentice-Hall of India, New Delhi, (2003).

How to Cite

S. K. Vaidya and R. M. Pandit, “Some results on global dominating sets”, Proyecciones (Antofagasta, On line), vol. 32, no. 3, pp. 235-244, 1.