排序方式: 共有1条查询结果,搜索用时 31 毫秒
1
1.
Restricted Edge Connectivity of Binary Undirected Kautz Graphs 总被引:2,自引:0,他引:2
OU Jian-pingDepartment of Mathematics Shantou University Shantou China Department of Mathematics Zhangzhou Normal College Zhangzhou China 《数学季刊》2004,19(1):47-50
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. 相似文献
1