The spectral radius of graphs with no intersecting triangles

Abstract

A graph on $2k+1$ vertices consisting of $k$ triangles which intersect in exactly one common vertex is called a $k$-fan and denoted by $F_k$. This paper aims to determine the graphs of order $n$ that have the maximum (adjacency) spectral radius among all graphs containing no $F_k$, for $n$ sufficiently large.

17 pages

Cited by in corpus (2)

• The signless Laplacian spectral radius of graphs with no intersecting triangles
• On the spectral radius of graphs without a star forest