Selection of activators in finding the burning number

Abstract

Graph burning is a model for spread of information in a network. In recent times social networks play a major role in the thought process of people and influences the social movements, election and politics. The burning number is an ideal model to calculate the speed at which information is passed throughout the network. The burning number is a number which burns a graph in minimum number of steps. In this paper, a hybrid algorithm is proposed to compute the burning number of network graph based on selection of activators. The algorithm uses spanning tree, weighted centrality and uses a vertex set that are edge connected with previously burnt set. The network graph used were ca-sandiauths, ca-netscience, dolphin and mahindas. A significant improvement was found in the process of finding minimum burning number of the graph.