蕴含K_6-C_4可图序列

Potentially K_6-C_4 Graphic Sequences

如果S有一个实现包含K6-C4作为子图,则称序列S为蕴含K6-C4可图.设σ(K6-C4,n)表示使得每个满足σ(S)≥σ(K6-C4,n)的n项可图序列S是蕴含K6-C4的最小度和.本文证明了σ(K6-C4,n)=6n-10对n≥6成立.

A sequence S is potentially K6 - C4 graphical if it has a realization containing a K6 - C4 as a subgraph. Let σ （ K6 - C4, n ）denote the smallest degree sum such that every n - term graphical sequences S with σ（S） ≥σ （ K6 - C4, n ） is potentially K6 - C4 graphical. In this paper, we prove that σ（ K6 - C4, n ）=6n - 10, for n ≥ 6.