Families of Graphs With Chromatic Zeros Lying on Circles

Abstract

We define an infinite set of families of graphs, which we call p-wheels and denote (Wh)(p)n, that generalize the wheel (p=1) and biwheel (p=2) graphs. The chromatic polynomial for (Wh)(p)n is calculated, and remarkably simple properties of the chromatic zeros are found: (i) the real zeros occur at q=0,1,...p+1 for n-p even and q=0,1,...p+2 for n-p odd; and (ii) the complex zeros all lie, equally spaced, on the unit circle |q-(p+1)|=1 in the complex q plane. In the n ∞ limit, the zeros on this circle merge to form a boundary curve separating two regions where the limiting function W(\(Wh)(p)\,q) is analytic, viz., the exterior and interior of the above circle. Connections with statistical mechanics are noted.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…