Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results

03/11/2019
by   Günter Rote, et al.
0

A tree with n vertices has at most 95^n/13 minimal dominating sets. The growth constant λ = √(95)≈ 1.4194908 is best possible. It is obtained in a semi-automatic way as a kind of "dominant eigenvalue" of a bilinear operation on sixtuples that is derived from the dynamic-programming recursion for computing the number of minimal dominating sets of a tree. We also derive an output-sensitive algorithm for listing all minimal dominating sets with linear set-up time and linear delay between successive solutions.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/07/2018

Neighborhood preferences for minimal dominating sets enumeration

We investigate two different approaches to enumerate minimal dominating ...
04/14/2020

The growth rate over trees of any family of set defined by a monadic second order formula is semi-computable

Monadic second order logic can be used to express many classical notions...
08/15/2018

Counting Minimal Transversals of β-Acyclic Hypergraphs

We prove that one can count in polynomial time the number of minimal tra...
06/25/2019

Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach

In this text, we prove the existence of an asymptotic growth rate of the...
11/11/2021

A Note on the Maximum Number of Minimal Connected Dominating Sets in a Graph

We prove constructively that the maximum possible number of minimal conn...
01/21/2022

An Approximation Algorithm for K-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints

K-best enumeration, which asks to output k best solutions without duplic...
04/10/2022

Minimal Roman Dominating Functions: Extensions and Enumeration

Roman domination is one of the many variants of domination that keeps mo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.