期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
REFINED CONNECTIVITY PROPERTIES OF ABELIAN CAYLEY GRAPHS 被引量:7
1
作者 LI QIAOLIANG (Department of Applied Mathematics, Shanghai Jiaotong University, Shanghai 200030, ChinaPresend in Department of Mathematics, Hunan Normal University, Changsha 410082, China.)LI QIAO (Department of Applied Mathematics, Shanghai Jiaotong Univ 《Chinese Annals of Mathematics,Series B》 SCIE CSCD 1998年第4期409-414,共6页
Restricted edge connectivity of a graph G is defined to be the minimum size |U| of a set U of edges such that G-U is disconnected and G-U contains no trivial component K1. The high order edge connectivity Ni, i1, is t... Restricted edge connectivity of a graph G is defined to be the minimum size |U| of a set U of edges such that G-U is disconnected and G-U contains no trivial component K1. The high order edge connectivity Ni, i1, is the number of edge outsets of size i. TO determine all Ni, i 1, for a general graph is NP-hard. In this paper, the authors evaluated the restricted edge connectivity and the high order edge connectivity Ni, 1 i -1, for any connected Abelian Cayley graphs explicitly. 展开更多
关键词 Abelian Cayley graph Restricted edge connectivity High order edge connectivity
全文增补中
上一页 1 下一页 到第
使用帮助 返回顶部