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 Field | Value | Language |
---|---|---|
dc.contributor.author | Kulli V.R. | |
dc.date.accessioned | 2020-06-12T15:02:40Z | - |
dc.date.available | 2020-06-12T15:02:40Z | - |
dc.date.issued | 2014 | |
dc.identifier.citation | Journal of Discrete Mathematical Sciences and Cryptography , Vol. 17 , 1 , p. 49 - 54 | en_US |
dc.identifier.uri | 10.1080/09720529.2014.881129 | |
dc.identifier.uri | http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/4208 | - |
dc.description.abstract | The 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.publisher | Taru Publications | |
dc.subject | common minimal total dominating graph | |
dc.subject | graph | |
dc.subject | minimal total dominating graph | |
dc.title | The Common Minimal Total Dominating Graph | en_US |
dc.type | Article | |
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.