The Chvatal-Erdos condition for panconnectivity of triangle-free graphs
文献类型：期刊论文
| 作者 | Wei, B; Zhu, YJ |
| 刊名 | DISCRETE MATHEMATICS
 |
| 出版日期 | 2002-05-31 |
| 卷号 | 252期号:1-3页码:203-214 |
| 关键词 | connectivity independence number panconnectivity triangle-free graphs |
| ISSN号 | 0012-365X |
| 英文摘要 | Let G be a triangle-free graph with it vertices whose independence number does not exceed its connectivity. In this paper, we prove if G is neither K-n/2,K-n/2 nor C-5, then (i) every edge of G is contained in cycles of every length i for 4 less than or equal to i less than or equal to n; (ii) any pair of distinct vertices of G is connected by paths of i vertices for any 5 less than or equal to i less than or equal to n. This generalizes a recent result by Lou (Discrete Math. 152 (1996) 253). (C) 2002 Elsevier Science B.V. All rights reserved. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000176293900014 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/17594]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Wei, B |
| 作者单位 | Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Wei, B,Zhu, YJ. The Chvatal-Erdos condition for panconnectivity of triangle-free graphs[J]. DISCRETE MATHEMATICS,2002,252(1-3):203-214. |
| APA | Wei, B,&Zhu, YJ.(2002).The Chvatal-Erdos condition for panconnectivity of triangle-free graphs.DISCRETE MATHEMATICS,252(1-3),203-214. |
| MLA | Wei, B,et al."The Chvatal-Erdos condition for panconnectivity of triangle-free graphs".DISCRETE MATHEMATICS 252.1-3(2002):203-214. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。