Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: total {k}-domatic number

Sortuj według:

Ogranicz wyniki do:

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

The total {k}-domatic number of digraphs

100%

Sheikholeslami S., Volkmann L.

Discussiones Mathematicae Graph Theory

2012

tom 32

nr 3

461-471

For a positive integer k, a total {k}-dominating function of a digraph D is a function f from the vertex set V(D) to the set {0,1,2, ...,k} such that for any vertex v ∈ V(D), the condition $∑_{u ∈ N^{ -}(v)}f(u) ≥ k$ is fulfilled, where N¯(v) consists of all vertices of D from which arcs go into v. A set ${f₁,f₂, ...,f_d}$ of total {k}-dominating functions of D with the property that $∑_{i = 1}^d f_i(v) ≤ k$ for each v ∈ V(D), is called a total {k}-dominating family (of functions) on D. The maximum number of functions in a total {k}-dominating family on D is the total {k}-domatic number of D, denoted by $dₜ^{{k}}(D)$. Note that $dₜ^{{1}}(D)$ is the classic total domatic number $dₜ(D)$. In this paper we initiate the study of the total {k}-domatic number in digraphs, and we present some bounds for $dₜ^{{k}}(D)$. Some of our results are extensions of well-know properties of the total domatic number of digraphs and the total {k}-domatic number of graphs.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Sheikholeslami S.

1 Volkmann L.

1 2012

Wyniki wyszukiwania

The total {k}-domatic number of digraphs