Please use this identifier to cite or link to this item: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/4208
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKulli V.R.
dc.date.accessioned2020-06-12T15:02:40Z-
dc.date.available2020-06-12T15:02:40Z-
dc.date.issued2014
dc.identifier.citationJournal of Discrete Mathematical Sciences and Cryptography , Vol. 17 , 1 , p. 49 - 54en_US
dc.identifier.uri10.1080/09720529.2014.881129
dc.identifier.urihttp://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/4208-
dc.description.abstractThe common minimal total dominating graph CDt (G) of a graph G is the graph with same vertex set as G with two vertices in CDt (G) adjacent if there is a minimal total dominating set in G containing them. In this paper we obtain some properties of this graph. © 2014 Taru Publications.en_US
dc.publisherTaru Publications
dc.subjectcommon minimal total dominating graph
dc.subjectgraph
dc.subjectminimal total dominating graph
dc.titleThe Common Minimal Total Dominating Graphen_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.