The Smallest Degree Sum That Yields Potentially Kr＋1 - K3-Graphic Sequences

作     者：Meng-xiao Yin 

作者机构：School of Computer and Electronics Information Guangxi University Nanning 530004 China Department of Applied Mathematics Hainan University Haikou 570228 China 

出 版 物：《Acta Mathematicae Applicatae Sinica》 (应用数学学报（英文版）)

年 卷 期：2006年第22卷第3期

页      面：451-456页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China (No.10401010) 

主　　题：Graph degree sequence potentially Kr+1-K3-graphic sequence 

摘      要：Let a（Kr,＋1 - K3,n） be the smallest even integer such that each n-term graphic sequence п= （d1,d2,…dn） with term sum σ（п） = d1 ＋ d2 ＋…＋ dn 〉 σ（Kr＋1 -K3,n） has a realization containing Kr＋1 - K3 as a subgraph, where Kr＋1 -K3 is a graph obtained from a complete graph Kr＋1 by deleting three edges which form a triangle. In this paper, we determine the value σ（Kr＋1 - K3,n） for r ≥ 3 and n ≥ 3r＋ 5.