IEEE - Institute of Electrical and Electronics Engineers, Inc. - Building hamiltonian networks using the cycles laplacian of the underlying graph

2015 IEEE International Symposium on Circuits and Systems (ISCAS)

Author(s): Cristian E. Onete ; Maria Cristina C. Onete
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 May 2015
Conference Location: Lisbon, Portugal
Conference Date: 24 May 2015
Page(s): 145 - 148
ISBN (Electronic): 978-1-4799-8391-9
DOI: 10.1109/ISCAS.2015.7168591
Regular:

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... View More

Advertisement