@article {
author = {Rodriguez-Velazquez, Juan Alberto and Klein, Douglas and Yi, Eunjeong},
title = {On the super domination number of graphs},
journal = {Communications in Combinatorics and Optimization},
volume = {5},
number = {2},
pages = {83-96},
year = {2020},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2019.26587.1122},
abstract = {The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum cardinality among all super dominating sets of $G$. In this paper, we obtain closed formulas and tight bounds for the super domination number of $G$ in terms of several invariants of $G$. We also obtain results on the super domination number of corona product graphs and Cartesian product graphs.},
keywords = {Super domination number,Domination number,Cartesian product,Corona product},
url = {http://comb-opt.azaruniv.ac.ir/article_13980.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_13980_027a87bda526f67f2d8f3430aa9c2c45.pdf}
}