Spectral extremal graphs without intersecting triangles as a minor

Let F s be the friendship graph obtained from s triangles by sharing a common vertex. For every s >= 2 and n >= 50s(2), the Turan number of F s was investigated by Erdos, Furedi, Gould and Gunderson (1995). For sufficiently large n , the F s-free graphs of order n which attain the maximum spectral radius were firstly characterized by Cioaba, Feng, Tait and Zhang (2020), and later uniquely determined by Zhai, Liu and Xue (2022). Recently, the spectral extremal problems were studied for graphs that do not contain a certain graph H as a minor. For instance, Tait (2019), Zhai and Lin (2022), Chen, Liu and Zhang (2024) solved the case of cliques, bicliques, cliques with some paths removed, respectively. Motivated by these results, we consider the spectral extremal problem for friendship graphs. Let K s boolean OR I n - s be the complete split graph, which is the join of a clique of size s with an independent set of size n-s. . For sufficiently large n , we prove that K s boolean OR I n - s is the unique graph that attains the maximal spectral radius over all n-vertex F s-minor-free graphs.