Burnability of double spiders and path forests
The burning number of a graph can be used to measure the spreading speed of contagion in a network. The burning number conjecture is arguably the main unresolved conjecture related to this graph parameter, which can be settled by showing that every tree of order m(2) has burning number at most m. Th...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | 論文 |
| 出版事項: |
Elsevier
2023
|
| 主題: | |
| オンライン･アクセス: | http://eprints.um.edu.my/39422/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|