- Tytuł:
- New Bounds on the Signed Total Domination Number of Graphs
- Autorzy:
-
Moghaddam, Seyyed Mehdi Hosseini
Mojdeh, Doost Ali
Samadi, Babak
Volkmann, Lutz - Powiązania:
- https://bibliotekanauki.pl/articles/31340895.pdf
- Data publikacji:
- 2016-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
open packing
signed total domination number
total limited packing
tuple total domination number - Opis:
- In this paper, we study the signed total domination number in graphs and present new sharp lower and upper bounds for this parameter. For example by making use of the classic theorem of Turán [8], we present a sharp lower bound on $ K_{r+1} $-free graphs for $ r \ge 2 $. Applying the concept of total limited packing we bound the signed total domination number of $ G $ with $ \delta (G) \ge 3 $ from above by $ n - 2 \floor{ \frac{ 2 \rho_0 (G) + \delta - 3 }{ 2 } } $. Also, we prove that $ \gamma_{st} (T) \le n − 2(s − s^′ ) $ for any tree $ T $ of order$ $ n, with $ s $ support vertices and $ s^′ $ support vertices of degree two. Moreover, we characterize all trees attaining this bound.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2016, 36, 2; 467-477
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł