Paper Info
Title
The Maximum Spectral Radius of Graphs Without Friendship Subgraphs.
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.
Year
DOI
Venue
2020
10.37236/9179
ELECTRONIC JOURNAL OF COMBINATORICS
DocType
Volume
Issue
Journal
27.0
4.0
ISSN
Citations 
PageRank 
1077-8926
1
0.37
References 
Authors
0
4
Name
Order
Citations
PageRank
Sebastian M. Cioaba1449.66
Lihua Feng26114.50
michael tait3157.78
Xiao-Dong Zhang49719.87