Bounds on perfect k-domination in trees: an algorithmic approach

DOI10.7494/OPMATH.2012.32.4.707MaRDI QIDQ4908862zbMATH OpenFDO

Authors K. A. Vidya, B. Chaluvaraju

Publication date 7 March 2013

Published in Opuscula Mathematica (Search for Journal in Brave)

zbMATH Keywords

perfect domination\(k\)-dominationperfect \(k\)-domination

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Perfect \(k\)-domination in graphs
• Generalized perfect domination in graphs
• Vertices contained in all or in no minimum \(k\)-dominating sets of a tree
• Perfect and quasiperfect domination in trees
• Quasiperfect domination in trees

Cited in

(7)

• Perfect \(k\)-domination in graphs
• Perfect and quasiperfect domination in trees
• Generalized perfect domination in graphs
• Quasiperfect domination in trees
• On non-z(mod k) dominating sets
• Vertices contained in all or in no minimum \(k\)-dominating sets of a tree
• DUAL-PERFECT DOMINATION IN GRAPHS

This page was built for publication: Bounds on perfect \(k\)-domination in trees: an algorithmic approach

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