Abstract:
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), i...Show MoreMetadata
Abstract:
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.
Date of Conference: 24-27 May 2015
Date Added to IEEE Xplore: 30 July 2015
Electronic ISBN:978-1-4799-8391-9
Contents 