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...
Saved in:
Main Authors: | Tan, Ta Sheng, Teh, Wen Chean |
---|---|
格式: | Article |
出版: |
Elsevier
2023
|
主題: | |
在線閱讀: | http://eprints.um.edu.my/39422/ |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
A note on graph burning of path forests
由: Tan, Ta Sheng, et al.
出版: (2024) -
A note on on-line Ramsey numbers of stars and paths
由: Mohd Latip, Fatin Nur Nadia Binti, et al.
出版: (2021) -
An enhanced computational model based on social spider optimisation algorithm for EEG- based emotion recognition
由: Al-Qammaz, Abdullah Yousef Awwad
出版: (2019) -
Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
由: Ghathwan, Khalil Ibrahim
出版: (2016) -
An experiment on the performance of shortest path algorithm
由: Chan, Simon Yew Meng, et al.
出版: (2016)