New Bounds on the Signed Total Domination Number of Graphs

• Autorzy: Seyyed Mehdi Hosseini Moghaddam , Doost Ali Mojdeh , Babak Samadi , Lutz Volkmann
• Języki publikacji: EN

Abstrakty

EN

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 δ(G) ≥ 3 from above by [...] . Also, we prove that γst(T) ≤ 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.

Słowa kluczowe

EN

open packing; signed total domination number; total limited packing; tuple total domination number

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2016
• Tom: 36
• Numer: 2
• Strony: 467-477

Daty

wydano

2016-05-01

otrzymano

2015-02-09

poprawiono

2015-08-14

zaakceptowano

2015-08-14

online

2016-04-15

Twórcy

autor

Seyyed Mehdi Hosseini Moghaddam

• Sama Technical and Vocatinal Training College Islamic Azad University, Qom Branch, Qom, Iran

autor

Doost Ali Mojdeh

• Department of Mathematics University of Mazandaran, Babolsar, Iran

autor

Babak Samadi

• Department of Mathematics Arak University, Arak, Iran

autor

Lutz Volkmann

• Lehrstuhl II für Mathematik RWTH Aachen University, 52056 Aachen, Germany

Identyfikatory

DOI

10.7151/dmgt.1871