Now showing items 1-1 of 1
Connected co-spectral graphs are not necessarily both Hamiltonian
(Australian Mathematical Society, 2005)
There are many examples of co-spectral graphs where one is connected while the other is not. A Hamiltonian cycle is a closed path that visits every vertex exactly once. Naturally, a graph needs to be connected to be ...