|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||Spectral Reconstruction and Isomorphism of graphs using variable neighbourhood search|
variable neighbourhood search
|Citation:||Caporossi G, Cvetkovic D & Rowlinson P (2014) Spectral Reconstruction and Isomorphism of graphs using variable neighbourhood search, Bulletin, Classe des Sciences Mathematiques et Naturelles, Sciences Mathematiques (39), pp. 23-38.|
|Abstract:||The Euclidean distance between the eigenvalue sequences of graphs G and H, on the same number of vertices, is called the spectral distance between G and H. This notion is the basis of a heuristic algorithmfor reconstructing a graph with prescribed spectrum. By using a graph Γ constructed from cospectral graphs G and H, we can ensure that G and H are isomorphic if and only if the spectral distance between Γ and G + K2 is zero. This construction is exploited to design a heuristic algorithm for testing graph isomorphism. We present preliminary experimental results obtained by implementing these algorithms in conjunction with a meta-heuristic known as a variable neighbourhood search.|
|Rights:||Publisher is open-access. Open access publishing allows free access to and distribution of published articles where the author retains copyright of their work by employing a Creative Commons attribution licence. Proper attribution of authorship and correct citation details should be given.|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.