Abstract
We prove several structural and hardness results concerning pairs of disjoint sets in graphs which are dominating or independent and dominating.
Original language | English |
---|---|
Pages (from-to) | 6451-6458 |
Number of pages | 8 |
Journal | Discrete Mathematics |
Volume | 309 |
Issue number | 23-24 |
DOIs | |
Publication status | Published - 6 Dec 2009 |
Externally published | Yes |
Keywords
- Domination
- Independence
- Inverse domination
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics