Independence and connectivity in 3-domination-critical graphs
文献类型：期刊论文
| 作者 | Zhang, LZ; Tian, F |
| 刊名 | DISCRETE MATHEMATICS
 |
| 出版日期 | 2002-12-28 |
| 卷号 | 259期号:1-3页码:227-236 |
| 关键词 | three-domination-critical graph independence number connectivity |
| ISSN号 | 0012-365X |
| 英文摘要 | Let delta, gamma, kappa and alpha be, respectively, the minimum degree, the domination number, the connectivity and the independence number of a graph G. The graph G is 3-domination-critical if gamma = 3 and the addition of any edge decreases gamma by 1. In this paper, we prove that if G is a 3-domination-critical graph, then alpha less than or equal to kappa + 2; and moreover, if kappa less than or equal to delta - 1, then alpha less than or equal to K + 1. We also give a short proof of Wojcicka's result, which says that every connected 3-domination-critical graph of order at least 7 contains a hamiltonian path (J. Graph Theory 14 (1990) 205). (C) 2002 Elsevier Science B.V. All rights reserved. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000180085900015 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/17112]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Zhang, LZ |
| 作者单位 | 1.Zhangzhou Teachers Coll, Dept Math, Fujian 363000, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Zhang, LZ,Tian, F. Independence and connectivity in 3-domination-critical graphs[J]. DISCRETE MATHEMATICS,2002,259(1-3):227-236. |
| APA | Zhang, LZ,&Tian, F.(2002).Independence and connectivity in 3-domination-critical graphs.DISCRETE MATHEMATICS,259(1-3),227-236. |
| MLA | Zhang, LZ,et al."Independence and connectivity in 3-domination-critical graphs".DISCRETE MATHEMATICS 259.1-3(2002):227-236. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。