Retinal Thickness on Stratus Optical Coherence Tomography in People with Diabetes and Minimal or No Diabetic Retinopathy
- 作者：Neil M. Bressler ; Allison R. Edwards ; Andrew N. Antoszyk ; Roy W. Beck ; David J. Browning ; Antonio P. Ciardella ; Ronald P. Danis ; Michael J. Elman ; Scott M. Friedman ; Adam R. Glassman ; Jeffrey G. Gross
- 关键词：Cage ; Degree set ; Girth
- 刊名：American Journal of Ophthalmology
- 出版年：2008
- 期刊代码：7_00029394
- 类别：med
- 出版时间：May 2008
- 卷：145
- 期：5
- 页码：894-901.e1
- 文件大小：177 K
摘要
By an ({r,m};g)-cage we mean a graph on a minimum number of vertices f({r,m};g) with degree set {r,m}, 2
r<m, and girth g. In this paper we improve the known lower bound for f({r,m};g) for even girth g
8. Moreover, we obtain for any integer k2 that f({r,k(r-1)+1};6)=2k(r-1)2+2r where r-1 a is prime power. This result supports the conjecture that f({r,m};6)=2(rm-m+1) for any r<m posed by Yuansheng and Liang [The minimum number of vertices with girth 6 and degree set D={r,m}, Discrete Math. 269 (2003) 249–258].
r<m, and girth g. In this paper we improve the known lower bound for f({r,m};g) for even girth g8. Moreover, we obtain for any integer k2 that f({r,k(r-1)+1};6)=2k(r-1)2+2r where r-1 a is prime power. This result supports the conjecture that f({r,m};6)=2(rm-m+1) for any r<m posed by Yuansheng and Liang [The minimum number of vertices with girth 6 and degree set D={r,m}, Discrete Math. 269 (2003) 249–258].