摘要
将图的燃烧数与连通度相结合,提出定向图的燃烧连通度的概念。在给出一些特殊定向图(如树、圈、轮的定向图等)的燃烧连通度和循环定向图、给定直径的定向图的燃烧连通度上界的基础上,设计一般定向图的燃烧连通度算法并分析其复杂性。
The burning number of the graph is combined with the connectivity to propose the concept of burning connectivity of the oriented graphs.Based on the burning connectivity of some special oriented graphs(such as oriented graphs of trees,circles,wheel,etc.),and upper bounds of burning connectivity of cyclic oriented graphs,oriented graphs with a given diameter.An algorithm for computing the burning connectivity of the general oriented graphs is designed,and the complexity of the algorithm is analyzed.
作者
夏龙苗
魏宗田
丁丽萍
XIA Longmiao;WEI Zongtian;DING Liping(Department of Mathematics,Xi'an University of Architecture and Technology,Xi'an 710055,Shanxi,China)
出处
《山东大学学报（理学版）》
CAS
CSCD
北大核心
2023年第12期127-133,共7页
Journal of Shandong University(Natural Science)
基金
国家自然科学基金资助项目(61902304)。
关键词
定向图
网络抗毁性
燃烧连通度
燃烧连通度算法
oriented graph
network invulnerability
burning connectivity
algorithm of burning connectivity
