The Smallest Degree Sum That Yields Potentially W_5-graphic Sequences
Chen Gang · Journal of Xuzhou Normal University · 2003
Gould, Jacobson and Lehel have considered a variation of the classical Turantype extremal problems as follows: for a given simple graph H, determine the smallest positive even number σ(H,n) such that every nterm graphic sequence π=(d1,d2,...,dn) with term sum σ(π)=d1+d2+...+dn≥σ(H,n) has a realization G containing H as a subgraph. In this article, the values of σ(W5,n) for n≥11 are determined, where Wr is the wheel with r vertices.