On potentially Kr+1 - U-graphical Sequences
文献类型：期刊论文
| 作者 | Lai, Chunhui1,2; Yan, Guiying2
|
| 刊名 | UTILITAS MATHEMATICA
 |
| 出版日期 | 2009-11-01 |
| 卷号 | 80页码:233-244 |
| 关键词 | graph degree sequence potentially Kr+1 - U-graphic sequence potentially Kr+1 - K-3 boolean OR P-3-graphic sequence |
| ISSN号 | 0315-3681 |
| 英文摘要 | Let K-m - H be the graph obtained from K-m by removing the edges set E(H) of the graph H (H is a subgraph of K-m). We use the symbol Z(4) to denote K-4 - P-2. A sequence S is potentially K-m - H-graphical if it has a realization containing a K-m - H as a subgraph. Let sigma (K-m - H, n) denote the smallest degree sum such that every n-term graphical sequence S with sigma(S) >= sigma(K-m - H, n) is potentially K-m - H-graphical. In this paper, we determine the values of sigma(Kr+1 - U, n) for n >= 5r+18, r+1 >= k > 7, j >= 6 where U is a graph on k vertices and j edges which contains a graph K-3 boolean OR P-3 but not contains a cycle on 4 vertices and not contains Z(4). |
| 资助项目 | NSF of Fujian[Z0511034] ; Fujian Provincial Training Foundation for "Bai-Quan-Wan Talents Engineering" ; Fujian Education Department and Project of Zhangzhou Teachers College |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000271281000019 |
| 出版者 | UTIL MATH PUBL INC |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/7245]  |
| 专题 | 应用数学研究所 |
| 通讯作者 | Lai, Chunhui |
| 作者单位 | 1.Zhangzhou Teachers Coll, Dept Math, Zhangzhou 363000, Fujian, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Ctr Graph Theory Combinator & Network, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Lai, Chunhui,Yan, Guiying. On potentially Kr+1 - U-graphical Sequences[J]. UTILITAS MATHEMATICA,2009,80:233-244. |
| APA | Lai, Chunhui,&Yan, Guiying.(2009).On potentially Kr+1 - U-graphical Sequences.UTILITAS MATHEMATICA,80,233-244. |
| MLA | Lai, Chunhui,et al."On potentially Kr+1 - U-graphical Sequences".UTILITAS MATHEMATICA 80(2009):233-244. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。