KMS Of Academy of mathematics and systems sciences, CAS
Some properties of 3-domination-critical graphs | |
Flandrin, E; Tian, F; Wei, B; Zhang, L | |
1999-07-28 | |
Source Publication | DISCRETE MATHEMATICS |
ISSN | 0012-365X |
Volume | 205Issue:1-3Pages:65-76 |
Abstract | 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. |
Language | 英语 |
WOS Research Area | Mathematics |
WOS Subject | Mathematics |
WOS ID | WOS:000081625300006 |
Publisher | ELSEVIER SCIENCE BV |
Citation statistics | |
Document Type | 期刊论文 |
Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/14613 |
Collection | 中国科学院数学与系统科学研究院 |
Affiliation | 1.Univ Paris 11, CNRS, URA 410, LRI, F-91405 Orsay, France 2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China |
Recommended Citation 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. |
Files in This Item: | ||||||
There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment