Graphs with few total dominating sets
From MaRDI portal
Recommendations
Cites work
- A note on the number of dominating sets of a graph
- Fibonacci index and stability number of graphs: a polyhedral study
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1529462 (Why is no real title available?)
- Majorization and the minimum number of dominating sets
- Minimal 2-dominating sets in trees
- Problems related to graph indices in trees
- Recurrence among trees with most numerous efficient dominating sets
- Total domination in graphs
- Total domination in graphs
- Trees having many minimal dominating sets
- Trees with extremal numbers of dominating sets
Cited in
(10)- Trees with minimum number of infima closed sets
- Toward a Nordhaus-Gaddum inequality for the number of dominating sets
- Bounds on the locating-total domination number in trees
- Majorization and the minimum number of dominating sets
- A note on the number of dominating sets of a graph
- scientific article; zbMATH DE number 871103 (Why is no real title available?)
- Graphs with the fewest matchings
- scientific article; zbMATH DE number 7742929 (Why is no real title available?)
- The number of dominating sets in d-ary trees
- The number of total dominating sets in binary trees
This page was built for publication: Graphs with few total dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699541)