Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: k-domination

Sortuj według:

Ogranicz wyniki do:

On the Totalk-Domination in Graphs

100%

Bermudo S., Hernández-Gómez J. C., Sigarreta J. M.

Discussiones Mathematicae Graph Theory

2017

tom 38

nr 1

301-317

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Bermudo S.

1 Hernández-Gómez J. C.

1 Sigarreta J. M.

1 2018

Wyniki wyszukiwania

On the Totalk-Domination in Graphs