期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
New Improvements on Connectivity of Cages
1
作者 Hong Liang LU yun Jian WU +1 位作者 qing lin yu yu qing lin 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2011年第6期1163-1172,共10页
A (δ, g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. In this paper, we show that all (δ, g)-cages with odd girth g ≥ 9 are r-connected, where (r - 1)2 ≤δ + x/δ ... A (δ, g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. In this paper, we show that all (δ, g)-cages with odd girth g ≥ 9 are r-connected, where (r - 1)2 ≤δ + x/δ - 2 〈 r2 and all (δ, g)-cages with even girth g 〉 10 are r-connected, where r is the largest integer satisfying r(r-1)2/4 + 1 + 2r(r - 1) ≤δ. These results support a conjecture of Fkl, Huang and Rodger that all (δ, g)-cages are 6-connected. 展开更多
关键词 CAGE GIRTH superconnectivity
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部