The Degree Polynomial
Jason I. Brown, Ian C. George
TL;DR
This work studies the zeros of degree polynomials $D(G;x)=\sum_{v} x^{\deg(v)}$ associated with graphs and multigraphs, aiming to understand where these roots lie and how they relate to degree sequences. By analyzing two representative families— CL_n (complete graphs with a leaf) and anti-regular graphs $H_n$ and $H_n^c$—the authors apply tools such as Descartes' rule of signs, the Intermediate Value Theorem, Rouche's theorem, Eneström-Kakeya bounds, and Beraha-Kahane-Weiss theory to characterize root locations and accumulation sets. They establish concrete patterns, including a dominant large negative root for CL_n and a unit-circle cluster of other roots, explicit root structures for even/odd anti-regular graphs, and general modulus bounds with extremal cases precisely described. A conjectured region $|z|\le (n-1)^{|\arg(z)|/\pi}$ is proposed to tightly bound roots across graph families, inviting further exploration of broader graph classes and rational roots.
Abstract
The degree polynomial of a multigraph $G$ is given by $\sum _{v \in V(G)} x^{\mbox{deg}(v)}$. We investigate here properties of the roots of such polynomials. In addition to examining the roots for some families of graphs with few and many degrees, we provide some bounds on the moduli of the roots. We also propose a region that contains all roots for multigraphs of order $n$.
