The Maximum Spectral Radius of Graphs Without Friendship Subgraphs
Copyright policy )NSF| Algebraic Methods in Extremal Combinatorics ,
NSF| Analytic and Geometric Inverse Problems and Related Topics
Sebastian M. Cioaba; Lihua Feng; Michael Tait; Xiao-Dong Zhang 0001;
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$ sufficiently large.
- Central South University China (People's Republic of)
- Villanova University United States
- Shanghai Jiao Tong University China (People's Republic of)
- University of Delaware United States
- University of California, Irvine United States
spectral radius, Extremal problems in graph theory, adjacency matrix, Graphs and linear algebra (matrices, eigenvalues, etc.), friendship graph, Paths and cycles
spectral radius, Extremal problems in graph theory, adjacency matrix, Graphs and linear algebra (matrices, eigenvalues, etc.), friendship graph, Paths and cycles
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).34 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 34
Top 10%
Top 10%
Top 10%
gold