Connectivity is an important indicator to measure the invulnerability of a network.This parameter is generalized from the perspective of graph burning,and the concept of restricted burning connectivity of graphs is proposed.On the basis of giving some basic graphs'restricted burning connectivity,the restricted burning connectivity calculation problems of the Cartesian product graph of paths and the spider graphs are studied by the mathematical programming method.By analyzing the relationship between restricted burning connectivity and graph structures,the advantages of this parameter in characterizing the invulnerability of net-works are clarified.
graphnetwork invulnerabilityrestricted burning connectivityCartesian product graphspider graphburning number
NETL
NSTL
万方数据
