Spectral upper bounds for the Grundy number of a graph

The Grundy number of a graph is the minimum number of colors needed to properly color the graph using the first-fit greedy algorithm regardless of the initial vertex ordering. Computing the Grundy number of a graph is an NP-Hard problem. There is a characterization in terms of induced subgraphs: a graph has a Grundy number at least k if and only if it contains a k-atom. In this paper, using properties of the matching polynomial, we determine the smallest possible largest eigenvalue of a k-atom. With this result, we present an upper bound for the Grundy number of a graph in terms of the largest eigenvalue of its adjacency matrix. We also present another upper bound using the largest eigenvalue and the size of the graph. Our bounds are asymptotically tight for some infinite families of graphs and provide improvements on the known bounds for the Grundy number of sparse random graphs. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.