Title :
Building hamiltonian networks using the cycles laplacian of the underlying graph
Author :
Onete, Cristian E. ; Onete, Maria Cristina C.
Author_Institution :
NXP Semicond., Eindhoven, Netherlands
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.
Keywords :
graph theory; integrated circuit layout; Hamiltonian circuit; Hamiltonian networks; Laplacian cycle; mesh description; planar graph; underlying graph; Buildings; Corporate acquisitions; Laplace equations; Merging; Mesh networks; Symmetric matrices; Transmission line matrix methods; Graph cycles; Hamiltonian graph; Hamiltonicity; Laplacian;
Conference_Titel :
Circuits and Systems (ISCAS), 2015 IEEE International Symposium on
Conference_Location :
Lisbon
DOI :
10.1109/ISCAS.2015.7168591
