Algorithmic aspects of total k-subdomination in graphs

DOI10.7151/DMGT.1296MaRDI QIDQ5492681zbMATH OpenOpenAlexFDO

Authors Laura Harris, Johannes H. Hattingh, Michael A. Henning

Publication date 16 October 2006

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1296

zbMATH Keywords

majority dominationsigned dominationtotal dominationtree

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Algorithmic aspects of minus total k-subdomination in graphs
• Algorithmic aspects of the \(k\)-domination problem in graphs
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• k-subdomination in graphs
• Algorithmic aspects of \(\mathcal{F}\)-domination in graphs
• Algorithmic aspects of disjunctive total domination in graphs
• scientific article; zbMATH DE number 1302196
• Algorithmic aspects of semitotal domination in graphs
• Algorithmic aspects of some variants of domination in graphs
• Algorithmic aspect of k-tuple domination in graphs.

Cited in

(7)

• \(k\)-edge subgraph problems
• k-subdomination in graphs
• Algorithmic aspect of k-tuple domination in graphs.
• Algorithms on subgraph overlap graphs
• Algorithmic aspects of minus total k-subdomination in graphs
• Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs
• scientific article; zbMATH DE number 5043395 (Why is no real title available?)

This page was built for publication: Algorithmic aspects of total k-subdomination in graphs

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