Trees with two disjoint minimum independent dominating sets

DOI10.1016/j.disc.2005.09.012zbMath1077.05076OpenAlexW2092808095MaRDI QIDQ2576837

Teresa W. Haynes, Michael A. Henning

Publication date: 29 December 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.012

zbMATH Keywords

independent domination number

Mathematics Subject Classification ID

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

Related Items (9)

On graphs admitting two disjoint maximum independent sets ⋮ Minimal graphs with disjoint dominating and paired-dominating sets ⋮ Construction for trees without domination critical vertices ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ Graphs with constant sum of domination and inverse domination numbers ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets ⋮ Disjoint dominating and 2-dominating sets in graphs ⋮ Remarks about disjoint dominating sets

Cites Work

• Construction of trees and graphs with equal domination parameters
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees with two disjoint minimum independent dominating sets