Please use this identifier to cite or link to this item:
Title: Hamilton-connectivity of 3-domination critical graphs with α=δ+1≥5
Authors: Chen, Yaojun
Cheng, T. C. Edwin
Ng, Chi-to Daniel
Subjects: Domination-critical graph
Issue Date: 6-Apr-2008
Publisher: Elsevier
Source: Discrete mathematics, Apr. 2008, v. 308, no. 7, p.1296-1307.
Abstract: A graph G is 3-domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. Let G be a 3-domination critical graph with toughness more than one. It was proved G is Hamilton-connected for the cases α ≤ δ (Discrete Mathematics 271 (2003) 1-12) and α=δ+2 (European Journal of Combinatorics 23(2002) 777-784). In this paper, we show G is Hamilton-connected for the case α= δ+1≥5.
Rights: Discrete Mathematics © 2007 Elsevier. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.disc.2007.03.075
ISSN: 0012-365X
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
DM13957.pdfPre-published version189.01 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.