%0 Journal Article
%T Note on the Burning Conjecture for Some Graphs
%A Qiuye Zhu
%A Yinkui Li
%J Open Journal of Applied Sciences
%P 1157-1167
%@ 2165-3925
%D 2025
%I Scientific Research Publishing
%R 10.4236/ojapps.2025.155080
%X Graph burning is a model for describing the spread of influence in social networks and the burning number is a parameter used to describe the speed of information spread. In 2016, Bonato proposed a graph burning conjecture: For any connected graph <math display='inline' xmlns='http://www.w3.org/1998/Math/MathML'>
 <mi>G</mi>
</math>

 with order <math xmlns='http://www.w3.org/1998/Math/MathML'>
 <mi>n</mi>
</math>

, the burning number <math xmlns='http://www.w3.org/1998/Math/MathML'>
 <mrow>
  <mi>b</mi><mrow><mo>(</mo>
   <mi>G</mi>
  <mo>)</mo></mrow><mo>&#x2264;</mo><mrow><mo>&#x2308;</mo> <mrow>
   <msqrt>
    <mi>n</mi>
   </msqrt>
   </mrow> <mo>&#x2309;</mo></mrow></mrow>
</math>

. In this paper, we confirm the burning conjecture for octopus graph and bicyclic graph.
%K Graph Burning
%K Burning Number
%K Octopus Graph
%K Bicyclic Graph
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=142515