On the complexity of strong and weak total domination in graphs

zbMATH Open1344.05110MaRDI QIDQ2820195FDOQ2820195

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)

Cited In (6)

• Independent strong weak domination: A mathematical programming approach
• Title not available (Why is that?)
• More results on the complexity of domination problems 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

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)