On Potentially K_(1,4)+P_2-graphic Sequences
Yan Wang · Journal of Xiamen University · 2008
Given a graph H,a graphic sequence π is potentially H-graphic if there is a realization of π containing H as a subgraph.Gould,Jacobson and Lehel considered an extremal problem on potentially H-graphic sequences as follows:determine the smallest even integer σ(H,n) such that every n-term positive graphic sequence π=(d1,d2,…,dn) with σ(π)≥σ(H,n) has a realization G containing H as a subgraph,where σ(π)=∑di from i=1 to n.In this paper,we characterize the potentially K1,5+P2-graphic sequences.The characterization implies the value of σ(K1,5+P2,n).