Gorain, B; Gupta, A T.; Lokhande, S A.; Mondal, K; Pandit, S
(2024-06-02)
Abstract:
Graph burning runs on discrete time-steps. The aim is to burn all the vertices in a given graph using a minimum number of time-steps. This number is known to be the burning number of the graph. The spread of ...