Target Set Selection Problem on Paths and Grids
碩士 === 國立中央大學 === 數學系 === 102 === In this paper, we are focus on the Target set Selection Problem (TSS Problem) on path. We also get some results on Pn□Pm. Consider two different rules of Bootstrap Percolation: Rule I and Rule II Under Rule I, we generalize Theorem 1, Theorem 2 and Theorem 3 ([3], [...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/14870951425581855153 |
| Summary: | 碩士 === 國立中央大學 === 數學系 === 102 === In this paper, we are focus on the Target set Selection Problem (TSS Problem) on path. We also get some results on Pn□Pm. Consider two different rules of Bootstrap Percolation:
Rule I and Rule II
Under Rule I, we generalize Theorem 1, Theorem 2 and Theorem 3 ([3], [6]) from Pn□Pn
to Pn□Pm.. Furthermore, we give some sufficient conditions for inequality such that equality holds. On the other hand, we have some properties under Rule II and results on path.
|
|---|