Characterizing C6＋P2-graphic Sequences  

作　　者：HU Li-li 

机构地区：[1]Department of Mathematics and Information Science, Zhangzhou Teacher’s College, Zhangzhou 363000 China

出　　处：《Chinese Quarterly Journal of Mathematics》2014年第2期238-243,共6页数学季刊（英文版）

基　　金：Foundation item： Supported by the National Natural Science Foundation of China（11101358）; Supported by the Project of Fujian Education Department（JA11165）; Supported by the Project of Education Department of Fujian Province（JA12209）; Supported by the Project of Zhangzhou Teacher＇s College（S11104）

摘　　要：For a given graph H, a graphic sequence π =(d1, d2, ···, dn) is said to be potentially H-graphic if π has a realization containing H as a subgraph. In this paper, we characterize the potentially C6+ P2-graphic sequences where C6+ P2 denotes the graph obtained from C6 by adding two adjacent edges to the three pairwise nonadjacent vertices of C6. Moreover, we use the characterization to determine the value of σ(C6+ P2, n).

关 键 词：GRAPH degree sequence potentially C6 ＋ P2-graphic sequences 

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