Maximum degree and spectral radius of graphs in terms of size

From MaRDI portal
Publication:6154430




Abstract: Research on the relationship of the (signless Laplacian) spectral radius of a graph with its structure properties is an important research project in spectral graph theory. Denote by ho(G) and q(G) the spectral radius and the signless Laplacian spectral radius of a graph G, respectively. Let kge0 be a fixed integer and G be a graph of size m which is large enough. We show that if ho(G)gesqrtmk, then C4subseteqG or K1,mksubseteqG. Furthermore, we prove that if q(G)gemk, then K1,mksubseteqG. Both these two results extend some known results.



Cites work







This page was built for publication: Maximum degree and spectral radius of graphs in terms of size

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