A Note on Graph Burning of Path Forests

Graph burning is a natural discrete graph algorithm inspired by the spread of social contagion. Despite its simplicity, some open problems remain steadfastly unsolved, notably the burning number conjecture, which says that every connected graph of order $m^2$ has burning number at most $m$. Earlier,...

Full description

Bibliographic Details

Published in:	Discrete Mathematics and Theoretical Computer Science Vol. 26:3; no. Discrete Algorithms; pp. 1 - 13
Main Authors:	Tan, Ta Sheng, Teh, Wen Chean
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.10.2024 Discrete Mathematics & Theoretical Computer Science
Subjects:	05c85, 05a17, 68r10 Algorithms Forests Mathematical research mathematics - combinatorics Methods Path analysis Trees (Graph theory) Malaysia
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!