Burning number of caterpillars

DOI10.1016/j.dam.2020.03.062zbMath1443.05149OpenAlexW3016925894MaRDI QIDQ777401

Huiqing Liu, Xiaolan Hu, Xuejiao Hu

Publication date: 7 July 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.03.062

zbMATH Keywords

caterpillardistance dominationburning number

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

Surviving rate of graphs and firefighter problem ⋮ A survey of graph burning ⋮ Burning graph classes ⋮ Parameterized complexity of graph burning ⋮ Improved pyrotechnics: closer to the burning number conjecture ⋮ Parameterized Complexity of Graph Burning ⋮ Burning numbers of path forests and spiders ⋮ Burning numbers of \(t\)-unicyclic graphs ⋮ Burnability of double spiders and path forests

Cites Work

• Unnamed Item
• On the burning number of generalized Petersen graphs
• Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
• Bounds on the burning number
• Burning number of graph products
• An upper bound on the burning number of graphs
• Burning graphs: a probabilistic perspective
• Burning number of theta graphs
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph is hard
• The number of caterpillars
• Burning a Graph as a Model of Social Contagion
• How to Burn a Graph

This page was built for publication: Burning number of caterpillars