@article{Article_69,

title = {2-Generalized burning number of square graphs},

journal = {Communications in Combinatorics, Cryptography & Computer Science},

volume = {2023},

issue = {2},

issn = { 2783-5456 },

year = {2023},

url = {http://cccs.sgh.ac.ir/Articles/2023/issue 2/2-9-2Generalizedburningnumberofsquaregraphs.pdf},

author = {Abolfazl Bahmani and Mojgan Emami and and Ozra Naserian},

keywords = {2-generalized burning number; Square graph.},

abstract = {The burning number of a graph G, denoted by b(G), is the minimum number of steps it takes to burn the graph. 2-Generalized burning number of G which is a generalization of b(G), denoted by b_2(G), is the minimum number of steps it takes to burn every vertex of G by burning vertices only if they are adjacent to at least 2 burned neighbors. In this paper, we give some bounds for the 2-generalized burning number of square graphs. In particular 2-generalized burning number of square graphs for some specific graphs are obtained.}

};