An independent dominating set in the complement of a minimum dominating set of a tree

DOI10.1016/j.aml.2009.08.008zbMath1214.05106OpenAlexW2000348815MaRDI QIDQ1049262

Michael A. Henning, Dieter Rautenbach, Christian Löwenstein

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

zbMATH Keywords

independencedominationinverse domination

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Minimal graphs with disjoint dominating and paired-dominating sets ⋮ On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets ⋮ Better hardness results for the minimum spanning tree congestion problem ⋮ Dominating and total dominating partitions in cubic graphs ⋮ Disjoint dominating and 2-dominating sets in graphs

Cites Work

• On a problem of Domke, Dunbar, Haynes, Hedetniemi, and Markus concerning the inverse domination number
• Inverse domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An independent dominating set in the complement of a minimum dominating set of a tree