Please use this identifier to cite or link to this item:
http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5441
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kulli V.R | |
dc.contributor.author | Soner N.D. | |
dc.date.accessioned | 2020-06-12T15:08:00Z | - |
dc.date.available | 2020-06-12T15:08:00Z | - |
dc.date.issued | 1997 | |
dc.identifier.citation | Indian Journal of Pure and Applied Mathematics , Vol. 28 , 7 , p. 917 - 920 | en_US |
dc.identifier.uri | http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5441 | - |
dc.description.abstract | Let F be a minimum edge dominating set of G. If E - F contains an edge dominating set say F?, then F? is called a complementary edge dominating set of G with respect to F. The complementary edge domination number ??c(G) of G is the minimum number of edges in a complementary edge dominating set of G. We note that ??c(G) is defined for graphs G with no isolated edges. In this paper, we obtain some bounds for ??c(G). Also Nordhaus-Gaddum type results are found. | en_US |
dc.subject | Complementary Edge | |
dc.subject | Graphs | |
dc.subject | Nordhaus-gaddum Type | |
dc.title | Complementary edge domination in graphs | 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.