Georgia Institute of Technology College of Sciences

Isospectral reductions on graphs remove certain nodes and change the weights of remaining edges. They preserve the eigenvalues of the adjacency matrix of the graph, their algebraic multiplicities and geometric multiplicities. They also preserve the eigenvectors. We call the graphs that can be isospectrally reduced to one same graph spectrally equivalent. I will give examples to show that two graphs can be spectrally equivalent or not based on the feature one picks for the equivalence class.