๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


On the queen domination problem
โœ Charles M. Grinstead; Bruce Hahne; David Van Stone ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 393 KB

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

cover
โœ Kennedy, Randileigh ๐Ÿ“‚ Fiction ๐Ÿ“… 2019 ๐ŸŒ English โš– 130 KB ๐Ÿ‘ 2 views
cover
โœ Mayfair, Megan ๐Ÿ“‚ Fiction ๐Ÿ“… 2019 ๐Ÿ› Crooked Cat Books ๐ŸŒ English โš– 179 KB ๐Ÿ‘ 2 views

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

cover
โœ Megan Mayfair ๐Ÿ“‚ Fiction ๐Ÿ“… 2019 ๐Ÿ› Crooked Cat Books ๐ŸŒ English โš– 179 KB ๐Ÿ‘ 3 views
A note on the characterization of domina
โœ Jason Fulman ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 191 KB

## 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