New bounds on the signed total domination number of graphs

DOI10.7151/DMGT.1871MaRDI QIDQ274707zbMATH OpenOpenAlexFDO

Authors Seyyed Mehdi Hosseini Moghaddam, Doost Ali Mojdeh, B. Samadi, Lutz Volkmann

Publication date 25 April 2016

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1502.02808

zbMATH Keywords

open packingsigned total domination numbertotal limited packingtuple total domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: 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 Turan, we present a sharp lower bound on this parameter for graphs with no complete graph of order r+1 as a subgraph. Also, we prove that n-2(s-s') is an upper bound on the signed total domination number of any tree of order n with s support vertices and s' support vertives of degree two. Moreover, we characterize all trees attainig this bound.

Recommendations

• On the inverse signed total domination number in graphs
• New and improved results on the signed (total) \(k\)-domination number of graphs
• New bounds on the signed domination numbers of graphs
• On signed edge total domination numbers of graphs
• Signed total \(k\)-domination in graphs.

Cites work

• scientific article; zbMATH DE number 6837043 (Why is no real title available?)
• scientific article; zbMATH DE number 1286740 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Limited packings in graphs
• Remarks on the minus (signed) total domination in graphs
• Signed Total Domination Nnumber of a Graph
• Signed total domination in graphs.
• Strong transversals in hypergraphs and double total domination in graphs
• \(k\)-tuple total domination in graphs

Cited in

(6)

• New bounds on the signed domination numbers of graphs
• Lower bounds on the signed (total) \(k\)-domination number
• A result on the optimal binding function of odd signable graphs
• New and improved results on the signed (total) \(k\)-domination number of graphs
• Bounds on the nonnegative signed domination number of graphs
• On the inverse signed total domination number in graphs

This page was built for publication: New bounds on the signed total domination number of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q274707)