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

DOI10.22049/cco.2018.26055.1071zbMath1394.05095OpenAlexW2888180870MaRDI QIDQ4583543

Lutz Volkmann

Publication date: 31 August 2018

Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_13779_039e0161b2a16abce42b7a252a65cb4e.pdf

zbMATH Keywords

clique numbersigned \(k\)-dominating functionsigned \(k\)-domination number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New bounds on the signed total domination number of graphs
• Lower bounds on the signed total \(k\)-domination number of graphs
• The signed \(k\)-domination number of directed graphs
• Remarks on the minus (signed) total domination in graphs
• Lower bounds on several versions of signed domination number
• Signed total domination in graphs.
• Inequalities relating domination parameters in cubic graphs
• Signed Total Domination Nnumber of a Graph
• On the Signed (Total) $k$-Domination Number of a Graph
• New and improved results on the signed (total) k-domination number of graphs

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