Building hamiltonian networks using the cycles laplacian of the underlying graph

In a previous paper [6] it has been shown that one can easily use the Laplacian of the mesh description of a planar graph in order to obtain the Hamiltonian circuit(s), if any, of the graph. In this work, we show how to adapt this method in order to build Hamiltonian networks.