| 蕴含K1,2,3可图序列的最小度和 |
| |
| 引用本文： | 马益聪. 蕴含K1,2,3可图序列的最小度和[J]. 集美大学学报(自然科学版), 2009, 14(1) |
| |
| 作者姓名： | 马益聪 |
| |
| 作者单位： | 集美大学理学院,福建,厦门,361021 |
| |
| 摘 要： | 经典Tur醤型问题的变形:确定最小的正偶数σ(H,n),使得对于每一个n项可图序列π=(d1,d2,…,dn),当σ(π)=d1+d2+…+dn≥σ(H,n)时,π是蕴含H可图的.确定了当n≥6时的σ(K1,2,3,n).
|
| 关 键 词： | 图 度序列 蕴含K1 2 3可图序列 |
The Smallest Degree Sum That Yields Potentially K_(1,2,3)-graphic Sequences |
| |
| MA Yi-cong. The Smallest Degree Sum That Yields Potentially K_(1,2,3)-graphic Sequences[J]. the Editorial Board of Jimei University(Natural Science), 2009, 14(1) |
| |
| Authors: | MA Yi-cong |
| |
| Affiliation: | School of Sciences;Jimei University;Xiamen 361021;China |
| |
| Abstract: | |
| |
| Keywords: | graph degree sequence potentially K1 2 3-graphic sequence |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
