Maximum number of minimum dominating and minimum total dominating sets
From MaRDI portal
Abstract: Given a connected graph with domination (or total domination) number gamma>=2, we ask for the maximum number m_gamma and m_{gamma,T} of dominating and total dominating sets of size gamma. An exact answer is provided for gamma=2and lower bounds are given for gamma>=3.
Recommendations
- On maximum number of minimal dominating sets in graphs
- Bounds on the maximum number of minimum dominating sets
- The maximum number of minimal dominating sets in a tree
- Majorization and the minimum number of dominating sets
- Minimal dominating sets in maximum domatic partitions
- Counting minimal dominating sets
- On the number of minimal dominating sets on some graph classes
- The number of minimum dominating sets in P_n P₂
- scientific article; zbMATH DE number 7742929
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
Cited in
(7)- Bounds on the maximum number of minimum dominating sets
- scientific article; zbMATH DE number 6383811 (Why is no real title available?)
- On maximum number of minimal dominating sets in graphs
- scientific article; zbMATH DE number 2077654 (Why is no real title available?)
- scientific article; zbMATH DE number 1439474 (Why is no real title available?)
- scientific article; zbMATH DE number 2192183 (Why is no real title available?)
- On the number of minimum dominating sets and total dominating sets in forests
This page was built for publication: Maximum number of minimum dominating and minimum total dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878219)