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 |
---|---|
Format: | Article |
Published: |
Elsevier
2023
|
Subjects: | |
Online Access: | http://eprints.um.edu.my/39422/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A note on on-line Ramsey numbers of stars and paths
by: Mohd Latip, Fatin Nur Nadia Binti, et al.
Published: (2021) -
An enhanced computational model based on social spider optimisation algorithm for EEG- based emotion recognition
by: Al-Qammaz, Abdullah Yousef Awwad
Published: (2019) -
Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
by: Ghathwan, Khalil Ibrahim
Published: (2016) -
Spider composition at Hulu Langat Recreational Forest Parks, Selangor, Malaysia
by: Sarkowi, Fateen Noorasyiqin, et al.
Published: (2020) -
An experiment on the performance of shortest path algorithm
by: Chan, Simon Yew Meng, et al.
Published: (2016)