计算机工程与应用2012，Vol.48Issue(7)：81-83,3.DOI:10.3778/j.issn.1002-8331.2012.07.020
星型网络的3-限制边连通性
3-restricted edge connectivity of star graph networks
摘要
Abstract
The n-dimensional star graph Sn is one of the most popular interconnection networks and the k-restricted edge connectivity of a graph G is the minimum cardinality of a set of edges, if any, whose deletion disconnects G and every remaining component has at least k vertices. The k-restricted edge connectivity is one of the most parameters to evaluate the reliability of a network. In general, the larger the k-restricted edge connectivity of a network is, the more reliable the network is. The k-restricted edge connectivity of n-dimensional star graph is investigated and the result that the 3-restricted edge connectivity of Sn is 3n - 7 for n≥3 is proved.关键词
互连网络/k-限制边连通度/可靠性/星型网络Key words
interconnection networks/k-restricted edge connectivity/reliability/star graph networks分类
信息技术与安全科学引用本文复制引用
赵元庆,金显华..星型网络的3-限制边连通性[J].计算机工程与应用,2012,48(7):81-83,3.基金项目
国家自然科学基金(No.41001251). （No.41001251）
