The weighted perfect domination problem
โ Scribed by Chain-Chin Yen; R.C.T. Lee
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 393 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A configuration of queens on an m X m chessboard is said to dominate the board if every square either contains a queen or is attacked by a queen. The configuration is said to be non-attacking if no queen attacks another queen. Let f(m) and g(m) equal the minimum number of queens and the minimum numb
Marigold Doyle's life was perfect, with a successful career and wonderful marriage. But when her husband, Julian, passes away, her life is thrown into turmoil as she discovers a trail of secrets Julian was hiding in the months prior to his death. Struggling with her grief, she knows she needs to fin
## Abstract A graph __G__ is domination perfect if for each induced subgraph __H__ of __G__, ฮณ(__H__) = __i__(__H__), where ฮณ and __i__ are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced characterization of