Bhat, R.S.Kamath, S.S.Bhat, S.R.2026-02-052012Applied Mathematical Sciences, 2012, 6, 109-112, pp. 5525-55311312885Xhttps://idr.nitk.ac.in/handle/123456789/26947For any edge x=uv of an isolate free graph G(V,E),(N[x]) is the subgraph induced by the vertices adjacent to u and v in G. We say that an edge x, e-dominates an edge y if y ? (N[x]). A set L ? E is an Edge-Edge Dominating Set (EED-set) if every edge in E-L is e-dominated by an edge in L. The edge-edge domination number ? <inf>ee</inf>(G) is the cardinality of a minimum EED-set. We find the relation ship between the new parameter and some known graph parameters.Edge-edge dominating sets (EED sets)Strong edge-edge dominating sets (SEED sets)