Exact double domination in graphs

DOI10.7151/dmgt.1282zbMath1106.05071OpenAlexW2005648417MaRDI QIDQ5492643

Abdelkader Khelladi, Mustapha Chellali, Frédéric Maffray

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.1282

zbMATH Keywords

treepolynomial time algorithmcubic graphdominating setNP-complete problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

A note on the k-tuple domination number of graphs ⋮ Almost injective colorings ⋮ A Taxonomy of Perfect Domination ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Public goods games in directed networks ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Multiple Domination ⋮ Efficient \((j, k)\)-dominating functions

This page was built for publication: Exact double domination in graphs