Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Algorithmic aspects of total-subdomination in graphs

100%

Harris L., Hattingh J., Henning M.

Discussiones Mathematicae Graph Theory

2006

tom 26

nr 1

5-18

Let G = (V,E) be a graph and let k ∈ Z⁺. A total k-subdominating function is a function f: V → {-1,1} such that for at least k vertices v of G, the sum of the function values of f in the open neighborhood of v is positive. The total k-subdomination number of G is the minimum value of f(V) over all total k-subdominating functions f of G where f(V) denotes the sum of the function values assigned to the vertices under f. In this paper, we present a cubic time algorithm to compute the total k-subdomination number of a tree and also show that the associated decision problem is NP-complete for general graphs.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Harris L.

1 Hattingh J.

1 Henning M.

1 2006

Wyniki wyszukiwania

Algorithmic aspects of total-subdomination in graphs