The orientable genus polynomial of a graph counts its cellular embeddings by genus. We show that for -connected cubic graphs it is a cycle matroid invariant, and that the genus polynomial and the adjacency spectrum are incomparable, with neither determining the other. We also exhibit cospectral cubic graphs with pairwise distinct genus polynomials, and compute the genus polynomials of all connected cubic graphs through vertices.
The full paper can be found here.