On the number of minimal dominating sets in some classes of trees
From MaRDI portal
Publication:3097133
zbMATH Open1231.05195MaRDI QIDQ3097133FDOQ3097133
Authors: Dorota Bród 
Publication date: 15 November 2011
Full work available at URL: http://www.m-hikari.com/ijcms-2011/9-12-2011/index.html
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (13)
- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
- Minimal Double Dominating Sets in Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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 \(\gamma\)-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)
