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).
展开▼