Twin Minus Total Domination Numbers In Directed Graphs

• Autorzy: Nasrin Dehgardi , Maryam Atapour
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

twin minus total dominating function; twin minus total domination number; directed graph.

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 4
• Strony: 989-1004

Daty

wydano

2017-11-27

otrzymano

2016-03-18

poprawiono

2016-08-22

zaakceptowano

2016-08-22

online

2017-09-02

Twórcy

autor

Nasrin Dehgardi

• , I.R.

autor

Maryam Atapour

• , I.R.

Identyfikatory

DOI

10.7151/dmgt.1983