Please use this identifier to cite or link to this item: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5117
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKulli V.R
dc.contributor.authorJanakiram B.
dc.date.accessioned2020-06-12T15:06:14Z-
dc.date.available2020-06-12T15:06:14Z-
dc.date.issued2005
dc.identifier.citationNational Academy Science Letters , Vol. 28 , 44147 , p. 389 - 392en_US
dc.identifier.urihttp://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5117-
dc.description.abstractLet 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.en_US
dc.subjectComplement of a graph
dc.subjectGlobal domination
dc.subjectGlobal nonsplit domination
dc.subjectGraph
dc.subjectNonsplit domination
dc.titleGlobal nonsplit domination in graphsen_US
dc.typeArticle
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.