Generalized perfect domination in graphs

DOI10.1007/s10878-012-9510-yzbMath1290.90081OpenAlexW2059231483MaRDI QIDQ2444147

K. A. Vidya, B. Chaluvaraju

Publication date: 8 April 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://eprints-bangaloreuniversity.in/4285/1/Cheluvaraju.pdf

zbMATH Keywords

dynamic programmingNP-completeness\(k\)-dominationperfect \(k\)-domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (2)

Perfect Italian domination on planar and regular graphs ⋮ Perfect domination polynomial of homogeneous caterpillar graphs and of full binary trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weighted perfect domination problem and its variants
• Bounds on perfect k-domination in trees: An algorithmic approach

This page was built for publication: Generalized perfect domination in graphs