GRAPHS COSPECTRAL WITH A FRIENDSHIP GRAPH OR ITS COMPLEMENT

Let n be any positive integer and fn be the friendship (or dutch windmill) graph with 2n+1vertices and 3n edges. here we study graphs with the same adjacency spectrum as fn. two graphs arecalled cospectral if the eigenvalues multiset of their adjacency matrices are the same. let g be a graphcospectral with fn. here we prove that if g has no cycle of length 4 or 5, then g = fn. moreover if gis connected and planar then g = fn. all but one of connected components of g are isomorphic to k2.the complement fn of the friendship graph is determined by its adjacency eigenvalues, that is, if fn iscospectral with a graph h, then h = fn.