About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Graph Theory
Paper
Minimum K‐hamiltonian graphs
Abstract
We consider two new classes of graphs arising from reliability considerations in network design. We want to construct graphs with a minimum number of edges which remain Hamiltonian after k edges (or k vertices) have been removed. A simple construction is presented for the case when k is even. We show that it is minimum k‐edge Hamiltonian. On the other hand, Chartrand and Kapoor previously proved that this class of graphs was also minimum k‐vertex Hamiltonian. The case when k is large (odd or even) is also considered. Some results about directed graphs are also presented. Copyright © 1984 Wiley Periodicals, Inc., A Wiley Company