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/5441| Title: | Complementary edge domination in graphs |
| Authors: | Kulli V.R Soner N.D. |
| Keywords: | Complementary Edge Graphs Nordhaus-gaddum Type |
| Issue Date: | 1997 |
| Citation: | Indian Journal of Pure and Applied Mathematics , Vol. 28 , 7 , p. 917 - 920 |
| 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. |
| URI: | http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5441 |
| 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.