Minimal Double Dominating Sets in Trees

DOI10.1007/978-3-319-08016-1_14MaRDI QIDQ3188844zbMATH OpenOpenAlexFDO

Authors Marcin Krzywkowski

Publication date 2 September 2014

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08016-1_14

zbMATH Keywords

combinatorial bounddominationdouble dominationexact exponential algorithmlisting algorithmminimal double dominating settree

Mathematics Subject Classification ID

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

Recommendations

• Minimal 2-dominating sets in trees
• scientific article; zbMATH DE number 5995289
• On the number of minimum dominating sets in trees
• Trees having many minimal dominating sets
• On the number of minimal dominating sets in some classes of trees
• scientific article; zbMATH DE number 7742929
• Vertices belonging to all or to no minimum double dominating sets in trees
• Minimal dominating sets in interval graphs and trees
• The maximum number of minimal dominating sets in a tree
• An algorithm for listing all minimal double dominating sets of a tree

Cited in

(7)

• Trees having many minimal dominating sets
• Vertices belonging to all or to no minimum double dominating sets in trees
• scientific article; zbMATH DE number 5995289 (Why is no real title available?)
• The maximum number of minimal dominating sets in a tree
• Minimal 2-dominating sets in trees
• An algorithm for listing all minimal 2-dominating sets of a tree
• An algorithm for listing all minimal double dominating sets of a tree

This page was built for publication: Minimal Double Dominating Sets in Trees

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