基于赋权连通度优化的图重构  

Reconstruction of graphs based on weighted connectivity optimization

作　　者：冯欣 魏宗田[1] 姜淑艳 FENG Xin;WEI Zongtian;JIANG Shuyan(Department of Mathematics,Xi′an University of Architecture and Technology,Xi′an 710055,China)

机构地区：[1]西安建筑科技大学数学系,陕西西安710055

出　　处：《纯粹数学与应用数学》2024年第3期548-557,共10页Pure and Applied Mathematics

基　　金：国家自然科学基金(61902304);陕西省自然科学基金(ZR19052).

摘　　要：提出赋权图的S−T颠覆策略和赋权连通度意义下的图重构概念.通过研究某些典型图类的基于赋权连通度优化的重构方法,构造赋权连通度达到最大或最小的赋权图,揭示了图的赋权连通度与权值的大小、赋权方式和图结构之间的关系.The S-T subversion strategy of weighted graphs and the concept of graph reconstruction based on the weighted connectivity are proposed.Aimed at weighted connectivity optimization,the reconstruction methods of some typical graphs are given.The relationship between the weighted connectivity and the size of the weight,the way of weighting,and the structure of graphs is revealed by the extreme graph constructing in weighted connectivity sense.

关 键 词：颠覆策略 赋权图 S−T重构 赋权连通度 优化 

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