On the complexity of the labeled domination problem in graphs

DOI10.1111/ITOR.12286MaRDI QIDQ2968509zbMATH OpenOpenAlexFDO

Authors Gabriela R. Argiroffo, V. Leoni, P. Torres

Publication date 16 March 2017

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12286

zbMATH Keywords

\(\{k\}\)-dominating function\(k\)-tuple dominating functioncomputational complexitylabeled dominating function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
• \(k\)-tuple domination in graphs
• The multiple domination and limited packing problems in graphs
• Complexity of Total {k}-Domination and Related Problems
• Total dominating functions on subclasses of chordal graphs

Cites work

• \(k\)-tuple domination in graphs
• Algorithmic aspect of k-tuple domination in graphs.
• Complexity of Total {k}-Domination and Related Problems
• Generalized domination and efficient domination in graphs
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1420904 (Why is no real title available?)
• Linear time solvable optimization problems on graphs of bounded clique-width
• Nordhaus-Gaddum inequalities for domination in graphs
• On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
• The multiple domination and limited packing problems in graphs
• Variations of \(Y\)-dominating functions on graphs

Cited in

(2)

• On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
• A unified approach for domination and packing problems in graphs

This page was built for publication: On the complexity of the labeled domination problem in graphs

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