OpenAlex
On the total k-domination number of graphs
Work
Year: 2012
Type: article
Abstract: Let k be a positive integer and let G = (V, E) be a simple graph.The k-tuple domination number γ ×k (G) of G is the minimum cardinality of a k-tuple dominating set S, a set that for every vertexWe kno... more
Cites: 7
Cited by: 9
Related to: 10
FWCI:
Citation percentile (by year/subfield): 69.4
Open Access status: bronze