1. IR @ Gulbarga University
  2. Faculty Publications
  3. 1. Journal Articles
Please use this identifier to cite or link to this item: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5400
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKulli V.R
dc.contributor.authorJanakiram B
dc.contributor.authorIyer R.R.
dc.date.accessioned2020-06-12T15:07:58Z-
dc.date.available2020-06-12T15:07:58Z-
dc.date.issued1999
dc.identifier.citationJournal of Discrete Mathematical Sciences and Cryptography , Vol. 2 , 43864 , p. 179 - 184en_US
dc.identifier.uri10.1080/09720529.1999.10697889
dc.identifier.urihttp://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5400-
dc.description.abstractA dominating set D of a graph G = (V, E) is a cototal dominating (c.t.d.) set if every vertex v ? V?D is not an isolated vertex in the induced subgraph V ? D>. The cototal domination number?cl (G) of G is the minimum cardinality of a c.t.d. set. The cototal domatic number dCt (G) of G is defined like domatic number d(G). In this paper, we establish some results concerning these parameters. © 1999 Taylor & Francis Group, LLC.en_US
dc.titleThe cototal domination number of a graphen_US
dc.typeArticle
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.