Pages that link to "Item:Q2576837"
From MaRDI portal
The following pages link to Trees with two disjoint minimum independent dominating sets (Q2576837):
Displaying 16 items.
- Graphs with constant sum of domination and inverse domination numbers (Q446329) (← links)
- On disjoint maximal independent sets in graphs (Q458376) (← links)
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets (Q501004) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Remarks about disjoint dominating sets (Q1045182) (← links)
- An independent dominating set in the complement of a minimum dominating set of a tree (Q1049262) (← links)
- A characterization of \(i\)-excellent trees (Q1598814) (← links)
- On independent \([1, 2]\)-sets in trees (Q1649903) (← links)
- A note on connected bipartite graphs having independent domination number half their order. (Q1767156) (← links)
- Trees of diameter 6 and 7 with minimum number of independent sets (Q2037661) (← links)
- Disjoint dominating and 2-dominating sets in graphs (Q2299982) (← links)
- Unique irredundance, domination and independent domination in graphs (Q2581412) (← links)
- Minimal graphs with disjoint dominating and paired-dominating sets (Q2656336) (← links)
- Construction for trees without domination critical vertices (Q2671102) (← links)
- On graphs admitting two disjoint maximum independent sets (Q5058163) (← links)
- On construction for trees making the equality hold in Vizing's conjecture (Q6057635) (← links)
