New bounds on the signed total domination number of graphs

DOI10.7151/dmgt.1871zbMath1334.05103arXiv1502.02808OpenAlexW2333580631MaRDI QIDQ274707

Lutz Volkmann, Seyyed Mehdi Hosseini Moghaddam, Babak Samadi, Doost Ali Mojdeh

Publication date: 25 April 2016

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

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

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

Related Items

Lower bounds on the signed (total) $k$-domination number

Cites Work

• \(k\)-tuple total domination in graphs
• Remarks on the minus (signed) total domination in graphs
• Limited packings in graphs
• Signed total domination in graphs.
• Signed Total Domination Nnumber of a Graph
• Strong Transversals in Hypergraphs and Double Total Domination in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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