Optimal 1-Hamiltonian graphs
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
DOI
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.