### Abstract

Two vertices u, w ∈ V vv-dominate each other if they incident on the same block. A vertex u ∈ V strongly vv-dominates a vertex w ∈ V if u and w, vv-dominate each other and d_{vv}(u) ≥ d_{vv}(w). A set of vertices is said to be strong vv-dominating set if each vertex outside the set is strongly vv-dominated by at least one vertex inside the set. The strong vv-domination number γ_{svv}(G) is the order of the minimum strong vv-dominating set of G. Similarly weak vv-domination number γ_{wvv}(G) is defined. We investigate some relationship between these parameters and obtain Gallai’s theorem type results. Several upper and lower bounds are established. In addition, we characterize the graphs attaining some of these bounds.

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

Pages (from-to) | 24-33 |

Number of pages | 10 |

Journal | Malaysian Journal of Science |

Volume | 38 |

Issue number | 3 |

DOIs | |

Publication status | Published - 01-01-2019 |

### All Science Journal Classification (ASJC) codes

- General

## Fingerprint Dive into the research topics of 'Strong (weak) VV-dominating set of a graph'. Together they form a unique fingerprint.

## Cite this

*Malaysian Journal of Science*,

*38*(3), 24-33. https://doi.org/10.22452/mjs.vol38no3.3