Two conjectures on the cospectrality of complete tripartite graphs are false
For a graph G of order n with adjacency eigenvalues lambda_1(G)>= ...>= lambda_n(G), the cospectrality of G within the set G of all graphs of order n is the smallest spectral distance from G to another graph of G. Abdollahi and Zakeri conjectured that for every n>= 4 the cospectrality of the complete tripartite graph K...