Abstract
In this study, graph burning, a deterministic discrete time graph process that can be interpreted as a model for spreading influence in social networks, is considered. The minimum number of steps in a graph-burning process is called the burning number of that graph. Intrinsically, the burning number of the Jahangir graph was examined, and then the path forests whose vertices are already burned were studied. As a result, the burning numbers of cycles with a single chord and theta graphs were obtained.
Sign-in/Register to access full text options 
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.
