Cycles containing given subsets in 1-tough graphs
文献类型：期刊论文
| 作者 | Li, JP; Shen, RQ; Tian, F |
| 刊名 | ARS COMBINATORIA
 |
| 出版日期 | 2001 |
| 卷号 | 58页码:193-204 |
| 关键词 | X-longest cycle X-dominating cycle and large degree sums |
| ISSN号 | 0381-7032 |
| 英文摘要 | For a graph G = (V,E) and X subset of or equal to V(G), let dist(G) (u, v) be the distance between the vertices u and v in G and sigma (3)(X) denote the minimum value of the degree sum (in G) of any three pairwise nonadjacent vertices of X. We obtain main result: If G is a 1-tough graph of order n and X subset of or equal to V(G) such that sigma (s)(X) > n and, for all x, y is an element of X, dist(G)(x,y)= 2 implies max{d(x), d(y)} greater than or equal to n-4/2, then G has a cycle C containing all vertices of X. This result generalizes a result of Bauer, Broersma and Veldman. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000168043000018 |
| 出版者 | CHARLES BABBAGE RES CTR |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/16890]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | 1.Yunnan Univ, Math Inst, Kunming 650091, Yunnan, Peoples R China 2.Yunnan Univ, Dept Math, Kunming 650091, Yunnan, Peoples R China 3.Acad Sinica, Inst Biophys, Beijing 100101, Peoples R China 4.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Li, JP,Shen, RQ,Tian, F. Cycles containing given subsets in 1-tough graphs[J]. ARS COMBINATORIA,2001,58:193-204. |
| APA | Li, JP,Shen, RQ,&Tian, F.(2001).Cycles containing given subsets in 1-tough graphs.ARS COMBINATORIA,58,193-204. |
| MLA | Li, JP,et al."Cycles containing given subsets in 1-tough graphs".ARS COMBINATORIA 58(2001):193-204. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。