On the number of dominating sets in some classes of trees

zbMATH Open1138.05317MaRDI QIDQ5454012FDOQ5454012

Dorota Bród

Publication date: 3 April 2008

zbMATH Keywords

treescountingdominating sets

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30)

Cited In (8)

• Counting Power Domination Sets in Complete m-ary 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
• On the number of minimum dominating sets in trees
• Title not available (Why is that?)
• Trees with extremal numbers of \(k\)-dominating sets
• Locating and total dominating sets in trees

   Recommendations

• Title not available (Why is that?) 👍 👎
• On the number of minimum dominating sets in trees 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A note on the number of dominating sets of a graph 👍 👎

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)