Connected graphs cospectral with a Friendship graph

Alireza Abdollahi, Shahrooz Janbaz

Let $n$ be any positive integer, the friendship graph $F_n$ consist of $n$ edge-disjoint triangles that all of them meeting in one vertex. A graph $G$ is called cospectral with a g…