只有两对顶点的度分别相等的图序列  

On the graphic sequences which only the degree of two for point is respectively equal

作　　者：徐建豪[1] 胡智全[2] 

机构地区：[1]湖北经济学院统计与应用数学系,430205 [2]华中师范大学数学与统计学学院,430079

出　　处：《华中师范大学学报（自然科学版）》2011年第2期186-188,共3页Journal of Central China Normal University：Natural Sciences

基　　金：国家自然科学基金项目(10671089)

摘　　要：只有两对顶点的度分别相等的图序列称为G(2,2)图序列.以Erdǒs-Gallai定理为基础,采用分段的方法讨论了G(2,2)图序列,得到非负整数不增序列d=(d_1,d_2,…,d_n)为G(2,2)图序列的充要条件.On the graphic sequences which only the degree of two for point is respectively equal is said a graphic sequence of G（2, 2）. This paper, based on Erdǒs-Gallai theorem, has discussed picture sequence for foundation with the method of section. It discussed the graphic sequence of G（2, 2） and obtaind a sufficient and necessary condition.

关 键 词：度 图序列 G(2 2)图序列 

分 类 号：O157.6[理学—数学]