An independent dominating set in the complement of a minimum dominating set of a tree
DOI10.1016/J.AML.2009.08.008zbMATH Open1214.05106OpenAlexW2000348815MaRDI QIDQ1049262FDOQ1049262
Authors: Michael A. Henning, Christian Löwenstein, Dieter Rautenbach 
Publication date: 8 January 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00018183/IfM_Preprint_M09_24.pdf
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
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (6)
- 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
- Title not available (Why is that?)
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)
