Pith. sign in

REVIEW

On the number of minimum dominating sets and total dominating sets in forests

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.13182 v1 pith:PIER6XCF submitted 2022-06-27 math.CO

On the number of minimum dominating sets and total dominating sets in forests

classification math.CO
keywords dominatinggammanumbersetsminimumdominationforestssqrt
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We show that the maximum number of minimum dominating sets of a forest with domination number $\gamma$ is at most $\sqrt{5}^{\gamma}$ and construct for each $\gamma$ a tree with domination number $\gamma$ that has more than $\frac{2}{5}\sqrt{5}^{\gamma}$ minimum dominating sets. Furthermore, we disprove a conjecture about the number of minimum total dominating sets in forests by Henning, Mohr and Rautenbach.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.