Abstract: For a given graph H, a graphic sequence π =（d₁, d₂, ···, d_n） is said to be potentially H-graphic if π has a realization containing H as a subgraph. In this paper, we characterize the potentially C₆+ P₂-graphic sequences where C₆+ P₂ denotes the graph obtained from C₆ by adding two adjacent edges to the three pairwise nonadjacent vertices of C₆. Moreover, we use the characterization to determine the value of σ（C₆+ P₂, n）. 

Key words:  graph, degree sequence, potentially C₆ + P₂-graphic sequences