Total $k$-rainbow domination subdivision number in graphs
A total $k$-rainbow dominating function (T$k$RDF) of $G$ is a function $f$ from the vertex set $V(G)$ to the set of all subsets of the set $\{1,\ldots,k\}$ such that (i) for any vertex $v\in V(G)$ with $f(v)=\emptyset$ the condition $\bigcup_{u \in N(v)}f(u)=\{1,\ldots,k\}$ is fulfilled, where $N(v)...
Main Authors: | Rana Khoeilar, Mahla Kheibari, Zehui Shao, Seyed Mahmoud Sheikholeslami |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2020-09-01
|
Series: | Computer Science Journal of Moldova |
Subjects: | |
Online Access: | http://www.math.md/files/csjm/v28-n2/v28-n2-(pp152-169).pdf |
Similar Items
-
Total $k$-Rainbow domination numbers in graphs
by: H. Abdollahzadeh Ahangar, et al.
Published: (2018-01-01) -
A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two
by: Rana Khoeilar, et al.
Published: (2020-12-01) -
Outer-independent k-rainbow domination
by: Qiong Kang, et al.
Published: (2019-12-01) -
The k-Rainbow Bondage Number of a Digraph
by: Amjadi Jafar, et al.
Published: (2015-05-01) -
Total 2-Rainbow Domination Numbers of Trees
by: Ahangar H. Abdollahzadeh, et al.
Published: (2021-05-01)