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:
| Main Author: | |
|---|---|
| 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!
|
| _version_ | 1832554500657774592 |
|---|---|
| author | Pak-Ken Wong |
| author_facet | Pak-Ken Wong |
| author_sort | Pak-Ken Wong |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-7bb6378cf3024e71a1bbb60886da00e4 |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1997-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-7bb6378cf3024e71a1bbb60886da00e42025-02-03T05:51:20ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251997-01-0120474574710.1155/S0161171297001026Hamiltonian-connected graphs and their strong closuresPak-Ken Wong0Department of Mathematics and Computer Science, Seton Hall University, South Orange 07079, NJ, USALet 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.http://dx.doi.org/10.1155/S0161171297001026Hamiltonian-connected graphstrong closuredegree sequence. |
| spellingShingle | Pak-Ken Wong Hamiltonian-connected graphs and their strong closures International Journal of Mathematics and Mathematical Sciences Hamiltonian-connected graph strong closure degree sequence. |
| title | Hamiltonian-connected graphs and their strong closures |
| title_full | Hamiltonian-connected graphs and their strong closures |
| title_fullStr | Hamiltonian-connected graphs and their strong closures |
| title_full_unstemmed | Hamiltonian-connected graphs and their strong closures |
| title_short | Hamiltonian-connected graphs and their strong closures |
| title_sort | hamiltonian connected graphs and their strong closures |
| topic | Hamiltonian-connected graph strong closure degree sequence. |
| url | http://dx.doi.org/10.1155/S0161171297001026 |
| work_keys_str_mv | AT pakkenwong hamiltonianconnectedgraphsandtheirstrongclosures |