On the number of minimal dominating sets in some classes of trees
From MaRDI portal
Publication:3097133
Recommendations
Cited in
(13)- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
- Minimal Double Dominating Sets in Trees
- scientific article; zbMATH DE number 2192152 (Why is no real title available?)
- scientific article; zbMATH DE number 1052836 (Why is no real title available?)
- Tree search algorithms for the dominating vertex set problem
- Intersection graph of minimal dominating sets of a graph
- Minimum-cost b-edge dominating sets on trees
- On the number of minimal dominating sets including the set of leaves in trees
- Reconfiguring minimum dominating sets: the -graph of a tree
- Minimum Dominating Set for the Prism Graph Family
- On the number of dominating sets in some classes of trees
- An algebraic approach to sets defining minimal dominating sets of regular graphs
- Trees with extremal numbers of \(k\)-dominating sets
This page was built for publication: On the number of minimal dominating sets in some classes of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3097133)