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


The number of cycle lengths in graphs of given minimum degree and girth
Authors:P Erd s  R J Faudree  C C Rousseau  R H Schelp
Institution:

a Mathematics Institute, Hungarian Academy of Science, Budapest, Hungary

b Department of Mathematical Sciences, University of Memphis, Winfield Dunn Bldg., RM 373, Memphis, TN 38152, USA

Abstract:This paper determines lower bounds on the number of different cycle lengths in a graph of given minimum degree k and girth g. The most general result gives a lower bound of ckg/8.
Keywords:Cycle lengths  Girth  Minimum degree  Predecessor
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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