On the burning number of generalized Petersen graphs

DOI10.1007/S40840-017-0585-6MaRDI QIDQ723638zbMATH OpenOpenAlexFDO

Authors Kai An Sim, Ta Sheng Tan, K. B. Wong

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

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

Recommendations

• The burning numbers of generalized Peterson graphs \(P(n, 1)\) and \(P(n, 2)\)
• An upper bound on the burning number of graphs
• The generalized burning number of graphs
• Bounds on the burning number
• How to Burn a Graph

Cites work

• An upper bound on the burning number of graphs
• Burning a graph as a model of social contagion
• Burning a graph is hard
• Burning graphs: a probabilistic perspective
• How to Burn a Graph

Cited in

(12)

• Burning number of theta graphs
• Surviving rate of graphs and firefighter problem
• APX-hardness and approximation for the \(k\)-burning number problem
• The burning numbers of generalized Peterson graphs \(P(n, 1)\) and \(P(n, 2)\)
• Burning numbers of \(t\)-unicyclic graphs
• Burning number of caterpillars
• The generalized burning number of graphs
• Burning Numbers of Barbells
• Burning number of Jahangir graphs
• Graph burning: tight bounds on the burning numbers of path forests and spiders
• Burning numbers of path forests and spiders
• On the burning number of \(p\)-caterpillars

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723638)