Turán’s Theorem Implies Stanley’s Bound

Let G be a graph with m edges and let ρ be the largest eigenvalue of its adjacency matrix. It is shown that

Bibliographic Details
Main Author:	Nikiforov V.
Format:	Article
Language:	English
Published:	University of Zielona Góra 2020-05-01
Series:	Discussiones Mathematicae Graph Theory
Subjects:	graph spectral radius stanley’s bound turán’s theorem clique number motzkin-straus’s inequality walks 05c50
Online Access:	https://doi.org/10.7151/dmgt.2287

Internet

https://doi.org/10.7151/dmgt.2287