Some results on global dominating sets

• Vaidya, S. K. ^[1] ; Pandit, R. M. ^[2]
  1. [1] Saurashtra University

     Saurashtra University

     India

     
  2. [2] A. V. Parekh Technical Institute.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 32, Nº. 3, 2013, págs. 235-244
• Idioma: inglés
• DOI: 10.4067/S0716-09172013000300003
• Enlaces
  • Texto completo
• Resumen

  • 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.

• Referencias bibliográficas
  • Citas [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,...
  • [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,...
  • [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,...
  • [6] D. B. West, Introduction to Graph Theory, Prentice-Hall of India, New Delhi, (2003).