On the complexity of strong and weak total domination in graphs

MaRDI QIDQ2820195zbMATH OpenFDO

Authors Nader Jafari Rad

Publication date 14 September 2016

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://ajc.maths.uq.edu.au//pdf/65/ajc_v65_p053.pdf

zbMATH Keywords

total dominating setsplit graphs

Mathematics Subject Classification ID

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

Recommendations

• Weak total domination in graphs
• Bounds on weak and strong total domination in graphs
• Secure total domination in graphs: bounds and complexity
• On parameters related to strong and weak domination in graphs
• Hardness results of global total \(k\)-domination problem in graphs

Cited in

(11)

• Weak total domination in graphs
• Independent strong weak domination: A mathematical programming approach
• scientific article; zbMATH DE number 7671000 (Why is no real title available?)
• Total dominating functions on subclasses of chordal graphs
• More results on the complexity of domination problems in graphs
• On parameters related to strong and weak domination in graphs
• A note on the locating-total domination in graphs
• Complexity of Total {k}-Domination and Related Problems
• A short note on the complexity of computing strong pathbreadth
• The strong domination problem in block graphs and proper interval graphs
• scientific article; zbMATH DE number 2104725 (Why is no real title available?)

This page was built for publication: On the complexity of strong and weak total domination in graphs

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