Burning number of graph products

DOI10.1016/j.tcs.2018.06.036zbMath1401.05257OpenAlexW2863831359WikidataQ129598205 ScholiaQ129598205MaRDI QIDQ1784749

Paweł Prałat, Elham Roshanbin, Dieter Mitsche

Publication date: 27 September 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.06.036

zbMATH Keywords

graph productsburning number

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph operations (line graphs, products, etc.) (05C76)

Related Items (13)

Surviving rate of graphs and firefighter problem ⋮ Burning graph classes ⋮ Parameterized complexity of graph burning ⋮ Graph burning: tight bounds on the burning numbers of path forests and spiders ⋮ Burning Two Worlds ⋮ Parameterized Complexity of Graph Burning ⋮ Burning numbers of path forests and spiders ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Improved bounds for burning fence graphs ⋮ Burning numbers of \(t\)-unicyclic graphs ⋮ Burning number of caterpillars ⋮ Burnability of double spiders and path forests

Cites Work

• Bounds on the burning number
• Burning graphs: a probabilistic perspective
• Burning a graph is hard
• Burning a Graph as a Model of Social Contagion
• How to Burn a Graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Burning number of graph products