### Abstract

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, 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 γ
_{ee}(G) is the cardinality of a minimum EED-set. We find the relation ship between the new parameter and some known graph parameters.

Original language | English |
---|---|

Pages (from-to) | 5525-5531 |

Number of pages | 7 |

Journal | Applied Mathematical Sciences |

Volume | 6 |

Issue number | 109-112 |

Publication status | Published - 16-10-2012 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Applied Mathematics

### Cite this

*Applied Mathematical Sciences*,

*6*(109-112), 5525-5531.

}

*Applied Mathematical Sciences*, vol. 6, no. 109-112, pp. 5525-5531.

**Strong (weak) edge-edge domination number of a graph.** / Bhat, R. S.; Kamath, S. S.; Bhat, Surekha R.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Strong (weak) edge-edge domination number of a graph

AU - Bhat, R. S.

AU - Kamath, S. S.

AU - Bhat, Surekha R.

PY - 2012/10/16

Y1 - 2012/10/16

N2 - 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, 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 γ ee(G) is the cardinality of a minimum EED-set. We find the relation ship between the new parameter and some known graph parameters.

AB - 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, 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 γ ee(G) is the cardinality of a minimum EED-set. We find the relation ship between the new parameter and some known graph parameters.

UR - http://www.scopus.com/inward/record.url?scp=84867316998&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867316998&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84867316998

VL - 6

SP - 5525

EP - 5531

JO - Applied Mathematical Sciences

JF - Applied Mathematical Sciences

SN - 1312-885X

IS - 109-112

ER -