The spectral determinations of the join of two friendship graphs

The main aim of this study is to characterize new classes of multicone graphs which are determined by their adjacency spectra, their Laplacian spectra, their complement with respect to signless Laplacian spectra and their complement with respect to their adjacency spectra. A multicone graph is defined to be the join of a clique and a regular graph. If $n$ is a positive integer, a friendship graph $ F_n $ consists of $n$ edge-disjoint triangles that all of them meet in one vertex. It is proved that any connected graph cospectral to a multicone graph $ F_n\bigtriangledown F_n=K_2\bigtriangledown nK_2\bigtriangledown nK_2 $ is determined by its adjacency spectra as well as its Laplacian spectra. In addition, we show that if $ n\neq 2 $, the complement of these graphs are determined by their adjacency spectra. At the end of the paper, it is proved that multicone graphs $ F_n\bigtriangledown F_n=K_2\bigtriangledown nK_2\bigtriangledown nK_2 $ are determined by their signless Laplacian spectra and also we prove that any graph cospectral to one of multicone graphs $ F_n\bigtriangledown F_n $ is perfect. KCI Citation Count: 0