Strong (weak) VV-dominating set of a graph

Sayinath Udupa, R. S. Bhat

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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 dvv(u) ≥ dvv(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 languageEnglish
Pages (from-to)24-33
Number of pages10
JournalMalaysian Journal of Science
Issue number3
Publication statusPublished - 01-01-2019

All Science Journal Classification (ASJC) codes

  • General


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

Cite this