韧度变种与k-树的连通偶因子  

Toughness Variant and Connected Even Factors in k-tree

作　　者：兰美辉 高炜[2] LAN Meihui;GAO Wei(School of Information Engineering,Qujing Normal University,Qujing 655011,China;School of Information Science and Technology,Yunnan Normal University,Kunming 650500,China)

机构地区：[1]曲靖师范学院信息工程学院,云南曲靖655011 [2]云南师范大学信息学院,云南昆明650500

出　　处：《云南师范大学学报（自然科学版）》2023年第3期14-16,共3页Journal of Yunnan Normal University:Natural Sciences Edition

基　　金：国家自然科学基金资助项目(12161094).

摘　　要：连通偶[2,2 s]-因子H是G的连通生成子图,且每个顶点在H中的度属于{2,4,…,2s}.韧度变种用于衡量网络的易受攻击程度,是网络拓扑设计的重要指标.给出图存在连通偶[2,2 s]-因子的韧度变种条件,该结论在网络数据传输中有潜在的应用.Connected even[2,2s]-factor H is a connected spanning subgraph of G,and the degree of each vertex in H belongs to{2,4,…,2s}.The toughness variant is used to measure the vulnerability of the network and is an important indicator of network topology design.In this paper,the toughness variation condition of the existence of connected even[2,2s]-factor in a graph is given.This conclusion has potential applications in network data transmission.

关 键 词：韧度变种 树 连通因子 

分 类 号：O157.5[理学—数学]