Hamilton-connectivity of 3-domination-critical graphs with alpha <=delta
文献类型：期刊论文
| 作者 | Chen, YJ; Tian, F; Wei, B |
| 刊名 | DISCRETE MATHEMATICS
 |
| 出版日期 | 2003-09-28 |
| 卷号 | 271期号:1-3页码:1-12 |
| 关键词 | domination-critical graph Hamilton-connectivity |
| ISSN号 | 0012-365X |
| DOI | 10.1016/S0012-365X(02)00876-2 |
| 英文摘要 | A graph G is 3-domination critical if its domination number gamma is 3 and the addition of any edge decreases gamma by 1. Let G be a 3-connected 3-domination critical graph with alpha(G) less than or equal to delta(G). In this paper, we show that G is Hamilton-connected if and only if tau(G) > 1, where tau(G) is the toughness of G. (C) 2003 Elsevier B.V. All rights reserved. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000185241100001 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/18911]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Chen, YJ |
| 作者单位 | 1.Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China 2.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Chen, YJ,Tian, F,Wei, B. Hamilton-connectivity of 3-domination-critical graphs with alpha <=delta[J]. DISCRETE MATHEMATICS,2003,271(1-3):1-12. |
| APA | Chen, YJ,Tian, F,&Wei, B.(2003).Hamilton-connectivity of 3-domination-critical graphs with alpha <=delta.DISCRETE MATHEMATICS,271(1-3),1-12. |
| MLA | Chen, YJ,et al."Hamilton-connectivity of 3-domination-critical graphs with alpha <=delta".DISCRETE MATHEMATICS 271.1-3(2003):1-12. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。