Minimal 2-dominating sets in trees

DOI10.1051/ita/2013036zbMath1282.05179OpenAlexW2072500853MaRDI QIDQ5397717

Marcin Krzywkowski

Publication date: 24 February 2014

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9162fe3c9d0f4e7f4987feabbd128d313654d861

zbMATH Keywords

treecountingdominationexact exponential algorithm2-dominationlisting algorithmminimal 2-dominating set

Mathematics Subject Classification ID

Trees (05C05) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Graphs with few total dominating sets ⋮ Trees with extremal numbers of \(k\)-dominating sets

This page was built for publication: Minimal 2-dominating sets in trees