Journal Menu

Abstracting and Indexing
Aims and Scope
Article Processing Charges
Author Guidelines
Bibliographic Information
Contact Information
Editorial Board
Editorial Workflow
Reviewers Acknowledgment
Subscription Information

Abstract
Full-Text PDF
How to Cite this Article

International Journal of Mathematics and Mathematical Sciences 
Volume 20 (1997), Issue 4, Pages 745-747
doi:10.1155/S0161171297001026

Hamiltonian-connected graphs and their strong closures

Pak-Ken Wong

Department of Mathematics and Computer Science, Seton Hall University, South Orange 07079, NJ, USA

Received 15 September 1993; Revised 2 November 1993

Abstract

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.