|
|||||
|
|
Hamiltonian path graphs |
|
| Authors: | Gary Chartrand S. F. Kapoor E. A. Nordhaus |
| Abstract: | The Hamiltonian path graph H(G) of a graph G is that graph having the same vertex set as G and in which two vertices u and v are adjacent if and only if G contains a Hamiltonian u-v path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonian path graphs is presented. |
| Keywords: | |