Counting substructures and eigenvalues II: quadrilaterals

From MaRDI portal




Abstract: Let G be a graph and lambda(G) be the spectral radius of G. A previous result due to Nikiforov [Linear Algebra Appl., 2009] in spectral graph theory asserted that every graph G on mgeq10 edges contains a 4-cycle if lambda(G)>sqrtm. Define f(m) to be the minimum number of copies of 4-cycles in such a graph. A consequence of a recent theorem due to Zhai et al. [European J. Combin., 2021] shows that f(m)=Omega(m). In this article, by somewhat different techniques, we prove that f(m)=Theta(m2). We left the solution to limlimitsmightarrowinftyfracf(m)m2 as a problem, and also mention other ones for further study.














This page was built for publication: Counting substructures and eigenvalues II: quadrilaterals

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