蕴含K_(1,1,3)的正可图序列的最小度和  

The Smallest Degree Sum Yielding Potentially K_(1,1,3)-graphic Positive Sequences

作　　者：尹建华[1] 

机构地区：[1]海南大学信息科学技术学院,海南海口570228

出　　处：《海南大学学报（自然科学版）》2004年第3期200-204,共5页Natural Science Journal of Hainan University

基　　金：海南大学博士启动基金资助

摘　　要：Gould R J等人考虑了下述经典Turan型极值问题的变形:对于给定的图H,确定最小的正偶数σ(H,n),使得对于每一个n项正可图序列π=(d1,d2,…,dn),当σ(π)=d1+d2+…+dn≥σ(H,n)时,π有一个实现G以H作为子图.本文完全确定了σ(K1,1,3,n)之值,其中Kr,s,t是r×s×t完全三部图.Gould R J et al. considered a variation of extremal problems of the classical Turan-type as follows: For a given graph H,determine the smallest even integer δ(H,n) such that every n-term positive graphic sequence π = ( d1, d2,…, dn) with term sum σ(π) = d1 + d2 + … + dn ≥ σ( H, n) has a realization G containing H as a subgraph. In this paper, we completely determine the value of σ ( K1,1,3, n ), where Kr,s,t is the r x s x t complete 3-partite graph.

关 键 词：最小度和 图 蕴含K1 1 3 正可图序列 度序列 Turán型极值 

分 类 号：O157.5[理学—数学]