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 Fk. This paper aims to determine the graphs of order n that have the maximum (adjacency) spectral radius among all graphs containing no Fk, for n sufficiently large.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.