### 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 |

### All Science Journal Classification (ASJC) codes

- Applied Mathematics

## Fingerprint Dive into the research topics of 'Strong (weak) edge-edge domination number of a graph'. Together they form a unique fingerprint.

## Cite this

Bhat, R. S., Kamath, S. S., & Bhat, S. R. (2012). Strong (weak) edge-edge domination number of a graph.

*Applied Mathematical Sciences*,*6*(109-112), 5525-5531.