Structural Properties Of Extremal Trees, Balanced Spiders, And Path Forests With Respect To Burning Number
Graph burning is a discrete-time deterministic graph process that can be interpreted as a model for spread of influence in social networks. Bonato et al. conjectured in 2016 that for any connected graph of order N2, the burning number is at most N. This conjecture remains open, although remarkabl...
| 第一著者: | |
|---|---|
| フォーマット: | 学位論文 |
| 言語: | 英語 |
| 出版事項: |
2024
|
| 主題: | |
| オンライン･アクセス: | http://eprints.usm.my/62442/ |