Strong (Weak) Edge-Edge Domination Number of a Graph

Bhat, R S and Kamath , S S and Bhat, Surekha R (2012) Strong (Weak) Edge-Edge Domination Number of a Graph. Applied Mathematical Sciences, 6 (111). 5525`-5531. ISSN 1312-885X

Hikari_paper.pdf - Published Version

Download (109kB)
Official URL:


For 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, edominates an edge y if y ∈ 〈N[x]〉 . A set L ⊆ E is an Edge-Edge Dominating Set (EED-set) if every edge in is e-dominated by an edge in L. The edgeedge domination number Yee(G) is the cardinality of a minimum EED-set. We find the relation ship between the new parameter and some known graph parameters.

Item Type: Article
Uncontrolled Keywords: Edge-Edge Dominating sets (EED sets), Strong Edge-Edge Dominating sets (SEED sets)
Subjects: Engineering > MIT Manipal > Mathematics
Depositing User: MIT Library
Date Deposited: 22 Sep 2012 09:01
Last Modified: 22 Sep 2012 09:01

Actions (login required)

View Item View Item