中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Some properties of 3-domination-critical graphs

文献类型:期刊论文

作者Flandrin, E; Tian, F; Wei, B; Zhang, L
刊名DISCRETE MATHEMATICS
出版日期1999-07-28
卷号205期号:1-3页码:65-76
ISSN号0012-365X
英文摘要A graph G is 3-gamma-critical if its domination number gamma is 3 and the addition of any edge decreases gamma by 1. Wojcicka conjectured that every 3-gamma-critical graph with minimum degree delta greater than or equal to 2 has a hamiltonian cycle. in this paper, we prove that if G is a 3-gamma-critical connected graph of order n with minimum degree delta greater than or equal to 2, then (1) G is 1-tough; (2) the circumference of G is at least n - 1. (C) 1999 Elsevier Science B.V. All rights reserved.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000081625300006
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/14612]  
专题中国科学院数学与系统科学研究院
作者单位1.Univ Paris 11, CNRS, URA 410, LRI, F-91405 Orsay, France
2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Flandrin, E,Tian, F,Wei, B,et al. Some properties of 3-domination-critical graphs[J]. DISCRETE MATHEMATICS,1999,205(1-3):65-76.
APA Flandrin, E,Tian, F,Wei, B,&Zhang, L.(1999).Some properties of 3-domination-critical graphs.DISCRETE MATHEMATICS,205(1-3),65-76.
MLA Flandrin, E,et al."Some properties of 3-domination-critical graphs".DISCRETE MATHEMATICS 205.1-3(1999):65-76.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。