The spectral radius of graphs with no intersecting triangles

DOI10.37236/9179MaRDI QIDQ6330096arXivFDO

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

Publication date 29 November 2019

Published in arXiv

Full work available at URL https://doi.org/10.37236/9179

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

arXiv classification

math.CO

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.

This page was built for publication: The spectral radius of graphs with no intersecting triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6330096)