A graph on $2k+1$ vertices consisting of k triangles which intersect in exactly one common vertex is called a $k-$friendship graph and denoted by Fₖ. This paper determines the graphs of order n that have the maximum (adjacency) spectral radius among all graphs containing no Fₖ, for n sufficiently large.
No takes yet. Share an insight, caveat, or question.
Cioabă et al. (2020) studied this question.