Please use this identifier to cite or link to this item:
http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5502
Title: | The common minimal dominating graph |
Authors: | Kulli V.R Janakiram B. |
Issue Date: | 1996 |
Citation: | Indian Journal of Pure and Applied Mathematics , Vol. 27 , 2 , p. 193 - 196 |
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. |
URI: | http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5502 |
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.