Burning number of theta graphs

DOI10.1016/j.amc.2019.05.031zbMath1428.05238OpenAlexW2953372774MaRDI QIDQ2279597

Huiqing Liu, Xiaolan Hu, Ruiting Zhang

Publication date: 13 December 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.05.031

zbMATH Keywords

theta graphdistance dominationburning numberrooted tree partition

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Surviving rate of graphs and firefighter problem ⋮ A survey of graph burning ⋮ Parameterized complexity of graph burning ⋮ Parameterized Complexity of Graph Burning ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Burning number of caterpillars

Cites Work

• On the burning number of generalized Petersen graphs
• Bounds on the burning number
• An upper bound on the burning number of graphs
• Burning graphs: a probabilistic perspective
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph is hard
• Burning a Graph as a Model of Social Contagion
• Graph bootstrap percolation
• Cleaning Regular Graphs with Brushes
• Firefighting on a random geometric graph
• How to Burn a Graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Burning number of theta graphs