Optimal 1-Hamiltonian graphs

Title:	Optimal 1-Hamiltonian graphs
Authors:	Wang, JJ Hung, CN Hsu, LH 資訊工程學系 Department of Computer Science
Keywords:	hamiltonian cycle;token ring;fault tolerance
Issue Date:	13-Feb-1998
Abstract:	In this paper, we present a family of 3-regular, planar, and hamiltonian graphs. Any graph in this family remains hamiltonian if any node or any edge is deleted. Moreover, the diameter of any graph in this family is O(root p) where p is the number of nodes. (C) 1998 Elsevier Science B.V.
URI:	http://hdl.handle.net/11536/32792
ISSN:	0020-0190
Journal:	INFORMATION PROCESSING LETTERS
Volume:	65
Issue:	3
Begin Page:	157
End Page:	161
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.