Structural Properties and Hamiltonicity of Neighborhood Graphs.

Let G = ( V, E) be a simple undirected graph. N( G) = ( V, E N) is the neighborhood graph of the graph G, if and only if We present several structural properties of N( G) and characterize the hamiltonicity of N( G) by means of chords of a hamiltonian cycle in G. [ABSTRACT FROM AUTHOR]