On the Totalk-Domination in Graphs

• Autorzy: Sergio Bermudo , Juan C. Hernández-Gómez , José M. Sigarreta
• Języki publikacji: EN

Abstrakty

EN

Let G = (V, E) be a graph; a set S ⊆ V is a total k-dominating set if every vertex v ∈ V has at least k neighbors in S. The total k-domination number γkt(G) is the minimum cardinality among all total k-dominating sets. In this paper we obtain several tight bounds for the total k-domination number of a graph. In particular, we investigate the relationship between the total k-domination number of a graph and the order, the size, the girth, the minimum and maximum degree, the diameter, and other domination parameters of the graph.

Słowa kluczowe

EN

k-domination; total k-domination; k-tuple domination; k-tuple total domination

Kategorie tematyczne

• 05C69: Dominating sets, independent sets, cliques

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 38
• Numer: 1
• Strony: 301-317

Daty

wydano

2018-02-01

otrzymano

2016-04-21

poprawiono

2016-12-21

zaakceptowano

2016-12-21

online

2017-12-30

Twórcy

autor

Sergio Bermudo

• , , ,

autor

Juan C. Hernández-Gómez

• , , Carlos E. Adame 5, Col. La Garita, , Guerrero,

autor

José M. Sigarreta

• , , Carlos E. Adame 5, Col. La Garita, , Guerrero,

Identyfikatory

DOI

10.7151/dmgt.2016