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...

Full description

Bibliographic Details

Published in:	Applied mathematics and computation Vol. 438; p. 127574
Main Authors:	Tan, Ta Sheng, Teh, Wen Chean
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.02.2023
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!