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

Celý popis

Podrobná bibliografie

Vydáno v:	Discrete Mathematics and Theoretical Computer Science Ročník 26:3; číslo Discrete Algorithms; s. 1 - 13
Hlavní autoři:	Tan, Ta Sheng, Teh, Wen Chean
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Nancy DMTCS 01.10.2024 Discrete Mathematics & Theoretical Computer Science
Témata:	05c85, 05a17, 68r10 Algorithms Forests Mathematical research mathematics - combinatorics Methods Path analysis Trees (Graph theory) Malaysia
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!