Strong (weak) VV-dominating set of a graph

Document Type

Article

Publication Title

Malaysian Journal of Science

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 (u) ≥ d (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 γ (G) is the order of the minimum strong vv-dominating set of G. Similarly weak vv-domination number γ (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. vv vv svv wvv

First Page

24

Last Page

33

DOI

10.22452/mjs.vol38no3.3

Publication Date

1-1-2019

This document is currently not available here.

Share

COinS