首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Restricted Edge Connectivity of Binary Undirected Kautz Graphs
作者姓名:OU  Jian-ping
作者单位:OU Jian-ping Department of Mathematics,Shantou University,Shantou 515063,China; Department of Mathematics,Zhangzhou Normal College,Zhangzhou 363000,China
基金项目:Supported by the NNSF of China(10271105),Supported by the NSF of Fujian Education Ministry(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.

关 键 词:图论  曲线图  连通性  有限元模型

Restricted Edge Connectivity of BinaryUndirected Kautz Graphs
OU Jian-ping.Restricted Edge Connectivity of Binary Undirected Kautz Graphs[J].Chinese Quarterly Journal of Mathematics,2004,19(1):47-50.
Authors:OUJian-ping
Institution:DepartmentofMathematics,ShantouUniversity,Shantou515063,China
Abstract:
Keywords:Kautz graph  connectivity  restricted
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号