S. M. Hosseini Moghaddam

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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 packing we bound the signed total domination number of G with(More)
  • 1