科研之友
微信
新浪微博
Facebook
分享链接
摘要
For given a graph H, a graphic sequence pi = (d(1), d(2),..., d(n)) is said to be potentially H-graphic if there is a realization of pi containing H as a subgraph. In this paper, we characterize the potentially (K-5 - e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence pi to be potentially K-5-graphic, where K-r is a complete graph on r vertices and K-r - e is a graph obtained from K, by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence pi to be potentially K-6-graphic.
