Restricted Edge Connectivity of Binary Undirected Kautz Graphs  

作　　者：OU Jian-pingDepartment of Mathematics, Shantou University, Shantou 515063, China Department of Mathematics, Zhangzhou Normal College, Zhangzhou 363000, China 

出　　处：《Chinese Quarterly Journal of Mathematics》2004年第1期47-50,共4页数学季刊（英文版）

基　　金：Supported by the NNSF of China(10271105); Supported by the NSF of Fujian EducationMinistry(JA03145); Supported by the NNSF of China(10071080)

摘　　要：A restricted edge cut is an edge cut of a connected graph whose removal resultsin a disconnected graph without isolated vertices. The size of a minimum restricted edge cutof a graph G is called its restricted edge connectivity, and is denoted by λ′(G). Let ξ(G) bethe minimum edge degree of graph G. It is known that λ′(G) ≤ξ(G) if G contains restrictededge cuts. Graph G is called maximal restricted edge connected if the equality holds in thethe preceding inequality. In this paper, undirected Kautz graph UK(2, n) is proved to bemaximal restricted edge connected if n ≥ 2.

关 键 词：Kautz graph CONNECTIVITY RESTRICTED 

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