New Bounds on the Signed Total Domination Number of Graphs

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 Kr+1-free graphs for r ≥ 2. Applying the concept of total limited pac...

Full description

Bibliographic Details
Main Authors: Moghaddam Seyyed Mehdi Hosseini, Mojdeh Doost Ali, Samadi Babak, Volkmann Lutz
Format: Article
Language:English
Published: University of Zielona Góra 2016-05-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1871