Chromatic number and spectral radius
classification
🧮 math.CO
keywords
chromaticeigenvaluelargestnumberadjacencycomplementinggraphhoffman
read the original abstract
Let G be a graph, H be its chromatic number, L be the largest eigenvalue of its Laplacian, and M be the largest eigenvalue of its adjacency matrix. Then, complementing a well-known result of Hoffman, we show that L>=(H/(H-1))M
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.