The Maximum Spectral Radius of Graphs Without Friendship Subgraphs

  • Sebastian Cioabă
  • Lihua Feng
  • Michael Tait
  • Xiao-Dong Zhang
DOI: https://doi.org/10.37236/9179

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.

Published
2020-10-30
How to Cite
Cioabă , S., Feng, L., Tait, M., & Zhang, X.-D. (2020). The Maximum Spectral Radius of Graphs Without Friendship Subgraphs. The Electronic Journal of Combinatorics, 27(4), #P4.22. https://doi.org/10.37236/9179
Issue
Volume 27, Issue 4 (2020)
Article Number
P4.22