Burnability of double spiders and path forests

•Discrete-time deterministic graph algorithm modelling the spread of social contagion.•Tight bounds on the burning numbers of double spiders and path forests.•Well-burnability of path forests with sufficiently long paths.•Progress towards a conjecture stronger than the burning number conjecture. The...

Celý popis

Podrobná bibliografia

Vydané v:	Applied mathematics and computation Ročník 438; s. 127574
Hlavní autori:	Tan, Ta Sheng, Teh, Wen Chean
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.02.2023
Predmet:	Burning number conjecture Double spider Graph algorithm Path forest Spread of social contagion 91D30 Burning number conjecture 05C85 Path forest Double spider Spread of social contagion 68R10 Graph algorithm
ISSN:	0096-3003, 1873-5649
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!