On the burning number of generalized Petersen graphs

DOI10.1007/s40840-017-0585-6zbMath1393.05249OpenAlexW2775598079MaRDI QIDQ723638

Kok Bin Wong, Kai An Sim, Ta Sheng Tan

Publication date: 24 July 2018

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-017-0585-6

zbMATH Keywords

generalized Petersen graphsburning number

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items (7)

Surviving rate of graphs and firefighter problem ⋮ Graph burning: tight bounds on the burning numbers of path forests and spiders ⋮ Burning numbers of path forests and spiders ⋮ Burning number of theta graphs ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Burning numbers of \(t\)-unicyclic graphs ⋮ Burning number of caterpillars

Cites Work

• An upper bound on the burning number of graphs
• Burning graphs: a probabilistic perspective
• Burning a graph is hard
• Burning a Graph as a Model of Social Contagion
• How to Burn a Graph

This page was built for publication: On the burning number of generalized Petersen graphs