| 蕴含K1，2，3可图序列的最小度和 |
| |
| 引用本文： | 马益聪.蕴含K1，2，3可图序列的最小度和[J].厦门水产学院学报,2009(1):84-89. |
| |
| 作者姓名： | 马益聪 |
| |
| 作者单位： | 集美大学理学院,福建厦门361021 |
| |
| 摘 要： | 经典Turan型问题的变形：确定最小的正偶数σ（H，n），使得对于每一个n项可图序列π=（d1,d2,…,dn）,当σ（π）=d1＋d2＋…＋dn≥σ（H,n）时，π是蕴含N可图的．确定了当n≥6时的σ（K1，2，3，n）。
|
| 关 键 词： | 图 度序列 蕴含K1 2 3可图序列 |
The Smallest Degree Sum That Yields Potentially K1,2,3-graphic Sequences |
| |
| Authors: | MA Yi-cong |
| |
| Institution: | MA Yi-cong (School of Sciences, Jimei University, Xiamen 361021, China) |
| |
| Abstract: | A variation of classical Tur6n-type extremal problems is considered 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. The problem of determining the values of σ（K1,2,3, n） is mainly considered. |
| |
| Keywords: | graph degree sequence potentially K1 2 3-graphic sequence |
| 本文献已被 维普 等数据库收录！ |
|
