Introducing a vertex polynomial invariant for embedded graphs

Abstract: The ribbon group action extends geometric duality and Petrie duality by defining two embedded graphs as twisted duals precisely when they lie within the same orbit under this group action. Twisted duality yields numerous novel properties of fundamental graph polynomials. In this paper, we resolve a problem raised by Ellis-Monaghan and Moffatt [Trans. Amer. Math. Soc. 364 (2012), 1529--1569] for vertex counts by introducing the vertex polynomial: a generating function quantifying vertex distribution across orbits under the ribbon group action. We establish its equivalence via transformations of boundary component enumeration and derive recursive relations through edge deletion, contraction, and twisted contraction. For bouquets, we prove the polynomial depends only on signed intersection graphs. Finally, we provide topological interpretations for the vertex polynomial by connecting this polynomial to the interlace polynomial and the topological transition polynomial.