2016/01/26 by Liu, Chia-an, Weng, Chih-wen
#05C50 #15A18 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1601.07012
It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each of which is obtained from a complete bipartite graph by adding a vertex and an edge incident on the new vertex and an original vertex, which are not determined by their spectra.