Co-eigenvector graphs

These are the archives containing data on sets of graphs sharing common adjacency eigenbasis (co-eigenvector graphs). These sets are distributed in different archives: Hadamard graphs contains graphs on 8, 16 and 24 vertices that have one of Hadamard matrices as its eigenbasis; Integral regular graphs are graphs that are co-eigenvector to one of quartic integral graphs identified by Ian Wanless and Marsha Minchenko in Ars Math Contemp 8 (2015) 381–408; Small graphs are sets of co-eigenvector graphs on 6 to 10 vertices; Small trees are graphs on 6 to 15 vertices that are co-eigenvector to some tree; Small paths are graphs on 6 to 15 vertices that are co-eigenvector to a path.