Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: total outer-connected domination number

Sortuj według:

Ogranicz wyniki do:

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

Total outer-connected domination in trees

100%

Cyman J.

Discussiones Mathematicae Graph Theory

2010

tom 30

nr 3

377-383

Let G = (V,E) be a graph. Set D ⊆ V(G) is a total outer-connected dominating set of G if D is a total dominating set in G and G[V(G)-D] is connected. The total outer-connected domination number of G, denoted by $γ_{tc}(G)$, is the smallest cardinality of a total outer-connected dominating set of G. We show that if T is a tree of order n, then $γ_{tc}(T) ≥ ⎡2n/3⎤$. Moreover, we constructively characterize the family of extremal trees T of order n achieving this lower bound.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Cyman J.

1 2010

Wyniki wyszukiwania

Total outer-connected domination in trees