The spectral radius of graphs with no intersecting triangles

Sebastian Cioaba; Lihua Feng; Michael Tait; Xiao-Dong Zhang

The spectral radius of graphs with no intersecting triangles

Combinatorics 2019-12-02 v1

Authors: Sebastian Cioaba , Lihua Feng , Michael Tait , Xiao-Dong Zhang

Abstract

A graph on $2k+1$ vertices consisting of $k$ triangles which intersect in exactly one common vertex is called a $k$ -fan and denoted by $F_k$ . This paper aims to determine the graphs of order $n$ that have the maximum (adjacency) spectral radius among all graphs containing no $F_k$ , for $n$ sufficiently large.

Keywords

spectral graph theory graph pebbling graph theory

Cite

@article{arxiv.1911.13082,
  title  = {The spectral radius of graphs with no intersecting triangles},
  author = {Sebastian Cioaba and Lihua Feng and Michael Tait and Xiao-Dong Zhang},
  journal= {arXiv preprint arXiv:1911.13082},
  year   = {2019}
}

Comments

17 pages

Related papers

View all related →