TY - JOUR
ID - 14066
TI - Outer-weakly convex domination number of graphs
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Dayap, Jonecis A
AU - Alcantara, Richard
AU - Anoos, Roma
AD - University of San Jose-Recoletos
AD - University of Cebu
AD - Cebu Technological University-San Fernando Extension
Y1 - 2020
PY - 2020
VL - 5
IS - 2
SP - 207
EP - 215
KW - convex domination
KW - weakly-convex domination
KW - outer-connected domination
KW - outer-convex domination
KW - outer-weakly convex domination
DO - 10.22049/cco.2020.26871.1154
N2 - For a given simple graph $G=(V,E)$, a set $Ssubseteq V$ is an outer-weakly convex dominating set if every vertex in $Vsetminus S$ is adjacent to some vertex in $S$ and $Vsetminus S$ is a weakly convex set. The emph{outer-weakly convex domination number} of a graph $G$, denoted by $widetilde{gamma}_{wcon}(G)$, is the minimum cardinality of an outer-weakly convex dominating set of $G$. In this paper, we initiate the study of outer-weakly convex domination as a new variant of graph domination and we show the close relationship that exists between this novel parameter and other domination parameters of a graph. Furthermore, we obtain general bounds on $widetilde{gamma}_{wcon}(G)$ and, for some particular families of graphs, we obtain closed formula.
UR - http://comb-opt.azaruniv.ac.ir/article_14066.html
L1 - http://comb-opt.azaruniv.ac.ir/article_14066_322f3d041cb8dc320b968fd5222905f9.pdf
ER -