Burning number of caterpillars

DOI10.1016/J.DAM.2020.03.062zbMATH Open1443.05149OpenAlexW3016925894MaRDI QIDQ777401FDOQ777401

Authors Huiqing Liu, Xuejiao Hu, Xiaolan 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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)

Recommendations

• Burning numbers of path forests and spiders
• Enumeration of caterpillars
• A determination of the number of caterpillars
• Burning spiders
• On the burning number of \(p\)-caterpillars
• Bounds on the burning number
• Counting circular caterpillars
• Radio numbers of some caterpillars
• On the index of caterpillars

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An upper bound on the burning number of graphs
• Bounds on the burning number
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph as a model of social contagion
• Burning a graph is hard
• Burning graphs: a probabilistic perspective
• Burning number of graph products
• Burning number of theta graphs
• How to Burn a Graph
• Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
• On the burning number of generalized Petersen graphs
• The number of caterpillars

Cited in

(15)

• Burnability of double spiders and path forests
• Surviving rate of graphs and firefighter problem
• Burning graph classes
• Parameterized complexity of graph burning
• Parameterized Complexity of Graph Burning
• Burning Numbers of Barbells
• Burning spiders
• Burning number of Jahangir graphs
• A survey of graph burning
• Burning numbers of \(t\)-unicyclic graphs
• Burning numbers of path forests and spiders
• Orientable burning number of graphs
• Improved pyrotechnics: closer to the burning number conjecture
• The burning number conjecture holds asymptotically
• Spanning caterpillar in biconvex bipartite graphs

This page was built for publication: Burning number of caterpillars

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