摘要
设Fr是r个顶点的扇图,则对每一个n项可图序列π=(d1,d2,…,dn),蕴含扇图F5的可图序列的最小度和σ(F5,n)=4n-4,n≥5.
Let Fr be the fan with r vertices. For every n-term graphic sequence π=(d1 ,d2,…dn), it is proved that the smallest degree sum that yields potentially fan graphic sequences is σ(F5, n)= 4n-4, n≥5.
出处
《西北师范大学学报(自然科学版)》
CAS
2006年第4期27-30,共4页
Journal of Northwest Normal University(Natural Science)
基金
宁夏大学青年教师科研启动基金资助项目(QN0505)
关键词
可图序列
度序列
蕴含可图
扇图
最小度和
graphic sequence
degree sequence
potentially graphic
fan
smallest degree sum