The Maximum Number of Minimal Dominating Sets in a Tree

DOI10.1137/1.9781611975482.73zbMath1434.05116OpenAlexW4231223808MaRDI QIDQ5236257

Günter Rote

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975482.73

zbMATH Keywords

dominant eigenvalueminimal dominating sets of a tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

Algebraic Polytopes in Normaliz ⋮ It is undecidable whether the growth rate of a given bilinear system is 1 ⋮ Enumeration of minimal connected dominating sets for chordal graphs ⋮ Convex Characters, Algorithms, and Matchings ⋮ \(\gamma\)-graphs of trees ⋮ Growth of bilinear maps ⋮ Reconfiguring Minimum Dominating Sets in Trees ⋮ Growth of replacements ⋮ Trees with minimum number of infima closed sets

This page was built for publication: The Maximum Number of Minimal Dominating Sets in a Tree