The spectral radius of graphs with no intersecting triangles

2019/11/29 by Sebastian M. Cioabă, Sebastian Cioaba, Lihua Feng +7
Computer Science · Mathematics · #05C35 #05C50 #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Limits and Structures in Graph Theory #math.CO #msc:05C35 #msc:05C50

paper · pdf · doi:10.48550/arxiv.1911.13082

17 pages

arxiv created 2019/11/29 · openalex publication_date 2019/11/29 · arxiv updated 2019/12/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• The signless Laplacian spectral radius of graphs with no intersecting triangles
• Spectral radius of graphs of given size with forbidden a fan graph F₆
• Spectral extremal graphs for intersecting cliques
• Spectral extrema of graphs forbidding a fan
• Maximizing the spectral radius of graphs of given size with forbidden a subgraph