The Double Global Domination Number of a Graph

Jump To References Section

Authors

  • N. D. Soner
     Department of Mathematics, University of Mysore, Manasagangothri, Mysore-570006 ,IN
  • B. Chaluvaraju
     Department of Mathematics, University of Mysore, Manasagangothri, Mysore-570006 ,IN
  • B. Janakiram
     Department of Planning (PFRD), M.S. Building, Bangalore-560001 ,IN

Keywords:

Domination, Double Domination, Global Domination.

Abstract

Let G=(V, E) be a graph. A double dominating set D of G is a double global dominating set, if D is also a double dominating set of ¯G. The double global domination number γdg(G) of G is the minimum cardinality of a double global dominating set of G. In this paper, a study on this new parameter is initiated.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Downloads

Published

2003-12-01

How to Cite

Soner, N. D., Chaluvaraju, B., & Janakiram, B. (2003). The Double Global Domination Number of a Graph. The Journal of the Indian Mathematical Society, 70(1-4), 191–195. Retrieved from https://www.informaticsjournals.com/index.php/jims/article/view/21949

Issue

Volume 70, Issue 1-4, January-December 2003

Section

Articles

License

Copyright (c) 2003 N. D. Soner, B. Chaluvaraju, B. Janakiram

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.