Repozytorium publikacji - Politechnika Gdańska

Let G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected domination number of G is the minimum cardinality of a total outer–connected dominating set of G. We characterize all unicyclic graphs with equal total domination and total outer–connected domination numbers.

Autorzy

• dr inż. Joanna Raczek link otwiera się w nowej karcie