Hamiltonicity of k-connected graphs with independent claws
文献类型：期刊论文
| 作者 | Shen, RQ; Tian, F; Wei, B |
| 刊名 | ARS COMBINATORIA
 |
| 出版日期 | 1997-12-01 |
| 卷号 | 47页码:307-312 |
| 关键词 | Hamiltonian graph claw center |
| ISSN号 | 0381-7032 |
| 英文摘要 | In this paper, we prove that if G is a kappa-connected (k greater than or equal to 2) graph of order n such that the sum of degrees of any kappa + 1 independent vertices is at least n + kappa, and if the set of claw centers of G is independent, then G is hamiltonian. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000071326400029 |
| 出版者 | CHARLES BABBAGE RES CTR |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/13307]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | 1.Acad Sinica, Inst Biophys, Beijing 100101, Peoples R China 2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Shen, RQ,Tian, F,Wei, B. Hamiltonicity of k-connected graphs with independent claws[J]. ARS COMBINATORIA,1997,47:307-312. |
| APA | Shen, RQ,Tian, F,&Wei, B.(1997).Hamiltonicity of k-connected graphs with independent claws.ARS COMBINATORIA,47,307-312. |
| MLA | Shen, RQ,et al."Hamiltonicity of k-connected graphs with independent claws".ARS COMBINATORIA 47(1997):307-312. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。