Author(s)

Devadhas Nidha, Murugan Kala

Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli- 627 012, India.

The edge-domsaturation number ds'(G) of a graph G = (V, E) is the least positive integer k such that every edge of G lies in an edge dominating set of cardinality k. In this paper, we characterize unicyclic graphs G with ds'(G) = q – Δ'(G) + 1 and investigate well-edge dominated graphs. We further define γ'–-critical, γ'+-critical, ds'–-critical, ds'+-critical edges and study some of their properties.

Edge-Dominating Set; Edge-Domination Number; ds'- Critical; Edge-Domsaturation Number; Well Edge Dominated Graph

D. Nidha and M. Kala, "A Note on Edge-Domsaturation Number of a Graph," Open Journal of Discrete Mathematics, Vol. 2 No. 3, 2012, pp. 109-113. doi: 10.4236/ojdm.2012.23021.