| The Smallest Degree Sum That Yields Potentially Kr＋1 - K3-Graphic Sequences |
| |
| 作者姓名： | Meng-xiao Yin |
| |
| 作者单位： | [1]School of Computer and Electronics Information, Guangxi University, Nanning 530004, China [2]Department of Applied Mathematics, Hainan University, Haikou 570228, China |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China （No.10401010）. |
| |
| 摘 要： | 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.
|
| 关 键 词： | 图表 次数序列 潜在Kr＋1-K3-图形序列 完全图 |
| 收稿时间： | 2005-03-04 |
| 修稿时间： | 2005-03-04 |
The Smallest Degree Sum That Yields Potentially K
r+1 −K
3-Graphic Sequences |
| |
| Meng-xiao Yin.The Smallest Degree Sum That Yields Potentially K
r+1 −K
3-Graphic Sequences[J].Acta Mathematicae Applicatae Sinica,2006,22(3):451-456. |
| |
| Authors: | Meng-xiao Yin |
| |
| Institution: | (1) School of Computer and Electronics Information, Guangxi University, Nanning, 530004, China;(2) Department of Applied Mathematics, Hainan University, Haikou, 570228, China |
| |
| Abstract: | Abstract
Let σ(K
r+1 −K
3, n) be the smallest even integer such that each n-term graphic sequence π = (d
1, d
2, ··· , d
n
) with term sum σ(π) = d
1 + d
2 + ··· + d
n
≥ σ(K
r+1 −K
3, n) has a realization containing K
r+1 −K
3 as a subgraph, where K
r+1 −K
3 is a graph obtained from a complete graph K
r+1 by deleting three edges which form a triangle. In this paper, we determine the value σ(K
r+1 −K
3, n) for r ≥ 3 and n ≥ 3r + 5.
Supported by the National Natural Science Foundation of China (No.10401010). |
| |
| Keywords: | Graph degree sequence potentially K r+1 − K 3-graphic sequence |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
|
