Abstract
<abstract><p>The burning number $ b(G) $ of a graph $ G $, introduced by Bonato, is the minimum number of steps to burn the graph, which is a model for the spread of influence in social networks. In 2016, Bonato et al. studied the burning number of paths and cycles, and based on these results, they proposed a conjecture on the upper bound for the burning number. In this paper, we determine the exact value of the burning number of $ Q $ graphs and confirm this conjecture for $ Q $ graph. Following this, we characterize the single tail and double tails $ Q $ graph in term of their burning number, respectively.</p></abstract>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
