Burning number of caterpillars

DOI10.1016/J.DAM.2020.03.062MaRDI QIDQ777401zbMATH OpenOpenAlexFDO

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

burning numbercaterpillardistance domination

Mathematics Subject Classification ID

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

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

• 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
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• 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

(24)

• Burning numbers of path forests and spiders
• Burning numbers of \(t\)-unicyclic graphs
• Burnability of double spiders and path forests
• Surviving rate of graphs and firefighter problem
• Burning graph classes
• Parameterized complexity of graph burning
• Burning spiders
• A survey of graph burning
• Parameterized Complexity of Graph Burning
• Improved pyrotechnics: closer to the burning number conjecture
• Burning Numbers of Barbells
• The burning number conjecture holds asymptotically
• Orientable burning number of graphs
• Spanning caterpillar in biconvex bipartite graphs
• Burning number of Jahangir graphs
• The burning game on graphs
• Burning sufficiently large p-caterpillars for a fixed p
• Burning disjoint union of spider and path
• From burning extremal balanced spiders into properties for generalization to all trees
• Burn and win
• A note on graph burning of path forests
• Graphs with burning number three
• Orientable burning number of graphs
• A row generation algorithm for finding optimal burning sequences of large 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)