The Maximum Spectral Radius of Graphs Without Friendship Subgraphs

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_k$. This paper determines the graphs of order $n$  that have the maximum (adjacency) spectral radius among all graphs containing no $F_k$, for $n$ su...

Full description

Saved in:
Bibliographic Details
Published inThe Electronic journal of combinatorics Vol. 27; no. 4
Main Authors Cioabă, Sebastian, Feng, Lihua, Tait, Michael, Zhang, Xiao-Dong
Format Journal Article
LanguageEnglish
Published 30.10.2020
Online AccessGet full text

Cover

More Information
Summary: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_k$. This paper determines the graphs of order $n$  that have the maximum (adjacency) spectral radius among all graphs containing no $F_k$, for $n$ sufficiently large.
ISSN:1077-8926
1077-8926
DOI:10.37236/9179