Hamiltonian-connected graphs and their strong closures

Let G be a simple graph of order at least three. We show that G is Hamiltonian-connected if and only if its strong closure is Hamiltonian-connected. We also give an efficient algorithm to compute the strong closure of G.

Saved in:
Bibliographic Details
Main Author: Pak-Ken Wong
Format: Article
Language:English
Published: Wiley 1997-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Subjects:
Online Access:http://dx.doi.org/10.1155/S0161171297001026
Tags: Add Tag
No Tags, Be the first to tag this record!