Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: directed graph.

Sortuj według:

Ogranicz wyniki do:

Twin Minus Total Domination Numbers In Directed Graphs

100%

Dehgardi N., Atapour M.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 4

989-1004

Let D = (V,A) be a finite simple directed graph (shortly, digraph). A function f : V → {−1, 0, 1} is called a twin minus total dominating function (TMTDF) if f(N−(v)) ≥ 1 and f(N+(v)) ≥ 1 for each vertex v ∈ V. The twin minus total domination number of D is y*mt(D) = min{w(f) | f is a TMTDF of D}. In this paper, we initiate the study of twin minus total domination numbers in digraphs and we present some lower bounds for y*mt(D) in terms of the order, size and maximum and minimum in-degrees and out-degrees. In addition, we determine the twin minus total domination numbers of some classes of digraphs.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Atapour M.

1 Dehgardi N.

1 2017

Wyniki wyszukiwania

Twin Minus Total Domination Numbers In Directed Graphs