On strong  domination number of corona related graphs

S K Vaidya1* and S H Karkar2

doi:10.26637/MJM0504/0004

On strong domination number of corona related graphs

Authors :

S K Vaidya^1* and S H Karkar²

Author Address :

¹Department of Mathematics, Saurashtra University, Rajkot - 360 005, Gujarat, India.
²Government Engineering College, Rajkot - 360 005, Gujarat, India.

*Corresponding author.

Abstract :

Let $G =(V(G), E(G))$ be a graph and $uv in E(G)$ be an edge. A vertex $u$ strongly dominates $v$ if $d_G(u) geq d_G(v)$. A set $S subseteq V(G)$ is a $strong$ $dominating$ $set$ ($sd-set$) if every vertex $v in V(G)-S$ is strongly dominated by some $u$ in $S$. The minimum cardinality of a strong dominating set is called the strong domination number of $G$ which is denoted by $gamma_{st}(G)$. We investigate strong domination number of some corona related graphs.

Keywords :

Dominating set, domination number, strong dominating set, strong domination number.

DOI :

10.26637/MJM0504/0004

Article Info :

Received : July 28, 2017; Accepted : September 09, 2017.