Lower bounds on the signed total \(k\)-domination number of graphs

DOI10.1007/S00010-015-0375-XzbMath1336.05105OpenAlexW1989468995MaRDI QIDQ284687

Lutz Volkmann

Publication date: 18 May 2016

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00010-015-0375-x

zbMATH Keywords

signed total \(k\)-dominating functionsigned total \(k\)-domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

An introduction to the twin signed total k-domination numbers in directed graphs ⋮ Lower bounds on the signed (total) $k$-domination number ⋮ Signed and Minus Dominating Functions in Graphs

Cites Work

• Remarks on the minus (signed) total domination in graphs
• Lower bounds on several versions of signed domination number
• Signed total domination in graphs.
• Signed Total Domination Nnumber of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds on the signed total \(k\)-domination number of graphs