Author:
Cioabă Sebastian,Feng Lihua,Tait Michael,Zhang Xiao-Dong
Abstract
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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献