Year: 2025
Type: article
Abstract: 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 G with order n , the burning number b( G )≤⌈ n ⌉ . In this paper, we confirm the burning conjecture for octopus graph and bicyclic graph.
Source: Open Journal of Applied Sciences
Authors: Qiuye Zhu, Yinkui Li
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Award: G2484372132
OpenAlex ID: W4410243285