An independent dominating set in the complement of a minimum dominating set of a tree
From MaRDI portal
(Redirected from Publication:1049262)
Recommendations
- Trees with two disjoint minimum independent dominating sets
- Independent (k + 1)-domination in k-trees
- Domination, independent domination and \(k\)-independence in trees
- Cohabitation of independent sets and dominating sets in trees
- scientific article; zbMATH DE number 850313
- A new lower bound for the independent domination number of a tree
- A Note on Independent Sets in Trees
- On independent \([1, 2]\)-sets in trees
- Independent and double domination in trees
- Independent transversal total domination versus total domination in trees
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2192114 (Why is no real title available?)
- Inverse domination in graphs
- On a conjecture about inverse domination in graphs.
- On a problem of Domke, Dunbar, Haynes, Hedetniemi, and Markus concerning the inverse domination number
Cited in
(6)- scientific article; zbMATH DE number 1389220 (Why is no real title available?)
- Better hardness results for the minimum spanning tree congestion problem
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets
- Dominating and total dominating partitions in cubic graphs
- Disjoint dominating and 2-dominating sets in graphs
- Minimal graphs with disjoint dominating and paired-dominating sets
This page was built for publication: An independent dominating set in the complement of a minimum dominating set of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1049262)
