Geodesic
A note on the k-tuple domination number of graphs
Ars mathematica contemporanea, Volume 22 (2022) no. 4, article no. 03, 5 p.

See the original article notice from the Ars Mathematica Contemporanea website source

In a graph G, a vertex dominates itself and its neighbours. A set D ⊆ V(G) is said to be a k-tuple dominating set of G if D dominates every vertex of G at least k times. The minimum cardinality among all k-tuple dominating sets is the k-tuple domination number of G. In this note, we provide new bounds on this parameter. Some of these bounds generalize other ones that have been given for the case k = 2.
DOI: 10.26493/1855-3974.2600.dcc
Keywords: k-domination, k-tuple domination 
Abel Cabrera Martínez. A note on the k-tuple domination number of graphs. Ars mathematica contemporanea, Volume 22 (2022) no. 4, article  no. 03, 5 p.. doi: 10.26493/1855-3974.2600.dcc
@article{10_26493_1855_3974_2600_dcc,
     author = {Abel Cabrera Mart{\'\i}nez},
     title = {
		{A} note on the k-tuple domination number of graphs
	},
     journal = {Ars mathematica contemporanea},
     eid = {03},
     year = {2022},
     volume = {22},
     number = {4},
     doi = {10.26493/1855-3974.2600.dcc},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.2600.dcc/}
}
TY  - JOUR
AU  - Abel Cabrera Martínez
TI  - A note on the k-tuple domination number of graphs
	
JO  - Ars mathematica contemporanea
PY  - 2022
VL  - 22
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.2600.dcc/
DO  - 10.26493/1855-3974.2600.dcc
LA  - en
ID  - 10_26493_1855_3974_2600_dcc
ER  - 
%0 Journal Article
%A Abel Cabrera Martínez
%T A note on the k-tuple domination number of graphs
	
%J Ars mathematica contemporanea
%] 03
%D 2022
%V 22
%N 4
%U http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.2600.dcc/
%R 10.26493/1855-3974.2600.dcc
%G en
%F 10_26493_1855_3974_2600_dcc

Cited by Sources: