本文研究设计大规模网络的一种重要模型--强积图的超边连通度
人们用一个连通的无向图G来模拟
图G的超边连通度定义为最小超边割所含边数
给出了强积图是最大超边连通的充分条件
超边连通度; 最大超边连通 LV Min * （ School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui,230027
则S称为G的超边割
强积图
） Abstract： For a connected graph G, the super edge-connectivity is the minimum cardinality of an edge-cut S in G such that every component of G-S contains at least two vertices
It is a more refined index than the edge-connectivity
This paper deals with the super edge-connectivity of strong product graphs and gives a sufficient condition for it to be maximally super connected
Keywords： Networks; strong Product graph; super edge-connectivity;maximally super edge connected 下载PDF阅读器 PDF全文下载： 初稿 （ 25 ） 作者简介： Lv Min（1977-）, female, a lecturer , major research direction: reliability of networks and network code
通信联系人： 【收录情况】 中国科技论文在线： 吕敏
