Potentially F'_(k_1,k_2,1)-graphic Sequences
Jian-Hua Yin · Journal of Zhangzhou Normal University · 2009
Gould,Jacobson and Lehel considered the following variation: for given a graphH,determine the smallest even integer σ(H,n) such that every n-term graphic sequences π =(d_1,d_2,,d_n)with term sum σ(π)= d_1 +d_2++d_n ≥σ(H,n) has a realization G containing H as a subgraph.Let F'_(k_1,k_2,1) be the graph of k_1 copies of K_3 and k_2 copies of K_2 meeting in a common vertex.In this paper,we determine σ(F'_(k_1,k_2,1)n) for k_1 ≥1,k_2 ≥1 and n ≥ max {9/2k_1~2+7/2k_1-1/2,2k_1+k2+1}