On the number of dominating sets in some classes of trees
From MaRDI portal
Publication:5454012
zbMATH Open1138.05317MaRDI QIDQ5454012FDOQ5454012
Authors: Dorota Bród 
Publication date: 3 April 2008
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30)
Cited In (20)
- The set of all values of the domination number in trees with a given degree sequence
- Counting dominating sets and related structures in graphs
- A note on the number of dominating sets of a graph
- Counting Power Domination Sets in Complete m-ary Trees
- On the average order of a dominating set of a forest
- Trees with extremal numbers of dominating sets
- Construction of dominating sets of certain graphs
- Recurrence among trees with most numerous efficient dominating sets
- On the number of minimal dominating sets including the set of leaves in trees
- On trees attaining an upper bound on the total domination number
- On non-z(mod k) dominating sets
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms
- Dominating sets of centipedes
- Counting dominating sets in cactus chains
- On the number of minimal dominating sets in some classes of trees
- On the number of minimum dominating sets in trees
- Title not available (Why is that?)
- Efficient 2-domination in trees
- Trees with extremal numbers of \(k\)-dominating sets
- Locating and total dominating sets in trees
This page was built for publication: On the number of 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 Q5454012)
