A Characterization on Potentially K-6 - E(K-3)-graphic Sequences

作者：Yin, Meng-Xiao^*; Yin, Jian-Hua

来源：Ars Combinatoria, 2013, 111: 193-206.

• graph
• degree sequence
• potentially K-6 - E(K-3)-graphic sequence

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 potentially K-6 - E(K-3)-graphic sequences without zero terms, where K-6 - E(K-3) is the graph obtained from a complete graph on 6 vertices by deleting three edges which form a triangle. This characterization implies the values of sigma(K-6 - E(K-3), n).

• 出版日期2013-7
• 单位海南大学; 广西大学