GULBARGA UNIVERSITY, KALABURAGI Institutional Repository
Please use this identifier to cite or link to this item:
http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5502Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kulli V.R | |
| dc.contributor.author | Janakiram B. | |
| dc.date.accessioned | 2020-06-12T15:08:05Z | - |
| dc.date.available | 2020-06-12T15:08:05Z | - |
| dc.date.issued | 1996 | |
| dc.identifier.citation | Indian Journal of Pure and Applied Mathematics , Vol. 27 , 2 , p. 193 - 196 | en_US |
| dc.identifier.uri | http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5502 | - |
| dc.description.abstract | For any graph G, its common minimal dominating graph CD(G) is the graph having the same vertex set as G with two vertices in CD(G) adjacent if and only if there exists a minimal dominating set in G containing them. In this paper, characterizations are given for graphs G for which CD(G) is connected and CD(G) = G. Further, several new results are developed relating to this new graph. | en_US |
| dc.title | The common minimal 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.