Please use this identifier to cite or link to this item:
http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5117
Title: | Global nonsplit domination in graphs |
Authors: | Kulli V.R Janakiram B. |
Keywords: | Complement of a graph Global domination Global nonsplit domination Graph Nonsplit domination |
Issue Date: | 2005 |
Citation: | National Academy Science Letters , Vol. 28 , 44147 , p. 389 - 392 |
Abstract: | Let both G and ? be connected graphs. A set D of vertices in a graph G=(V,E) is said to be a global nonsplit dominating set if D is a nonsplit dominating set of both G and ?. The global nonsplit domination number ?gns (G) of G is the minimum cardinality of a global nonsplit dominating set. Beside bounds on ?gns (G), its relationship with other domination parameters is investigated. Also, some properties of global nonsplit dominating sets are given. |
URI: | http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5117 |
Appears in Collections: | 1. Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.