Temat: signed total domination number - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Bounds on the inverse signed total domination numbers in graphs
Autorzy:: Atapour, M.
Norouzian, S.
Sheikholeslami, S. M.
Volkmann, L.
Powiązania:: https://bibliotekanauki.pl/articles/255596.pdf
Data publikacji:: 2016
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: inverse signed total dominating function
inverse signed total domination number
Opis:: Let G = (V, E) be a simple graph. A function ƒ : V→ {- 1,1} is called an inverse signed total dominating function if the sum of its function values over any open neighborhood is at most zero. The inverse signed total domination number of G, denoted by [formula], equals to the maximum weight of an inverse signed total dominating function of G. In this paper, we establish upper bounds on the inverse signed total domination number of graphs in terms of their order, size and maximum and minimum degrees.
Źródło:: Opuscula Mathematica; 2016, 36, 2; 145-152
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: On the inverse signed total domination number in graphs
Autorzy:: Mojdeh, D. A.
Samadi, B.
Powiązania:: https://bibliotekanauki.pl/articles/255392.pdf
Data publikacji:: 2017
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: inverse signed total dominating function
inverse signed total domination number
k-tuple total domination number
Opis:: In this paper, we study the inverse signed total domination number in graphs and present new sharp lower and upper bounds on this parameter. For example by making use of the classic theorem of Turán (1941), we present a sharp upper bound on Kr+1-free graphs for r ≥ 2. Also, we bound this parameter for a tree from below in terms of its order and the number of leaves and characterize all trees attaining this bound.
Źródło:: Opuscula Mathematica; 2017, 37, 3; 447-456
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: On signed arc total domination in digraphs
Autorzy:: Asgharsharghi, L.
Khodkar, A.
Sheikholeslami, S. M.
Powiązania:: https://bibliotekanauki.pl/articles/254811.pdf
Data publikacji:: 2018
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: signed arc total dominating function signed arc total domination number domination in digraphs
Opis:: Let D = (V, A) be a finite simple digraph and N(uv) = {u'v' ≠ uv | u = u' or v = v'} be the open neighbourhood of uv in D. A function ƒ : A → { — 1, +1} is said to be a signed arc total dominating function (SATDF) of D if [formula] holds for every arc uv ∈ A. The signed arc total domination number [formula] is defined as [formula]. In this paper we initiate the study of the signed arc total domination in digraphs and present some lower bounds for this parameter.
Źródło:: Opuscula Mathematica; 2018, 38, 6; 779-794
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja