Bhat, R S and Kamath , S S and Bhat, Surekha R
(2012)
*Strong / Weak Edge Vertex Mixed Domination Number of a Graph.*
International Journal of Mathematical Sciences (IJMS), 11 (3).
pp. 433-444.
ISSN 0972-754X

PDF
SVED_paper.pdf - Published Version Restricted to Registered users only Download (7MB) | Request a copy |

## Abstract

For any v€ V, the set N(v)={u € V ! uv € E} is the openneighbourhood of the vertex v; while the set N[v]=N(v) U [v] is the closed neighbourhood of v. Similarly for any edge x=uv,N(x)= {y € E} y is adjacent to x } and N [x]=N(x)U{y}. further for any edge x=uv, Vx(N[x]) = {w € V! uw € E}. An edge x, m-dominates a vertex v if € Vx. Anedge x strongly (weakly) m –dominates the vertex v. A set L E is an Edge Vertex Dominating set (EVD-set) if every vertex in G is m-dominated by an edge in L. The edge vertex domination number Y (g) is the minimum cardinality of an EVD.set. A set L E is a strong edge vertex dominating set (SEVD-set) [Weak edge vertex dominating set (WEVD-set0] if every vertex in G is strongly (weakly) m-dominated by an edge in L. The strong (weak) edge vertex domination number Y(G) (y(G)) is the minimum cardinality of SEVD-set (WEVD-set), Besides finding the relationship between the existing graph parameters we prove a Gallai’s type results for edges. A new parameter called Edge Vertex Degree of an edge is defined and a bound in terms of the maximum and minimum EV degree is established.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | EV-degree, Edge vertex dominating sets, (EVD sets) Strong edge vertex dominating sets (SEVD sets), Weak edge vertex dominating sets (WEVD sets). |

Subjects: | Engineering > MIT Manipal > Mathematics |

Depositing User: | MIT Library |

Date Deposited: | 22 Sep 2012 09:01 |

Last Modified: | 26 Sep 2012 10:31 |

URI: | http://eprints.manipal.edu/id/eprint/77248 |

### Actions (login required)

View Item |