图的限制性燃烧连通度
Restricted burning connectivity of graphs
薛睿滢 1魏宗田 1翟美娟1
作者信息
- 1. 西安建筑科技大学理学院,陕西西安 710055
- 折叠
摘要
连通度是度量网络抗毁性的一个重要指标,从图燃烧的角度将该参数推广,提出图的限制性燃烧连通度概念.在给出若干基本图类的限制性燃烧连通度的基础上,用数学规划方法研究路的笛卡尔积图、蜘蛛图的限制性燃烧连通度计算问题.通过分析限制性燃烧连通度与图结构的关系,阐明该参数在刻画网络抗毁性方面的优势.
Abstract
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.
关键词
图/网络抗毁性/限制性燃烧连通度/笛卡尔积图/蜘蛛图/燃烧数Key words
graph/network invulnerability/restricted burning connectivity/Cartesian product graph/spider graph/burning number引用本文复制引用
基金项目
国家自然科学基金资助项目(61902304)
出版年
2024
NETL
NSTL
万方数据