The regularity and h-polynomial of Cameron-Walker graphs

Abstract: Fix an integer

n g e q 1

, and consider the set of all connected finite simple graphs on

n

vertices. For each

G

in this set, let

I (G)

denote the edge ideal of

G

in the polynomial ring

R = K [x_{1}, l d o t s, x_{n}]

. We initiate a study of the set

m a t h c a l R D (n) s u b s e t e q m a t h b b N^{2}

consisting of all the pairs

(r, d)

where

r = m r e g (R / I (G))

, the Castelnuovo-Mumford regularity, and

d = m d e g h_{R / I (G)} (t)

, the degree of the

h

-polynomial, as we vary over all the connected graphs on

n

vertices. In particular, we identify sets

A (n)

and

B (n)

such that

A (n) s u b s e t e q m a t h c a l R D (n) s u b s e t e q B (n)

. When we restrict to the family of Cameron-Walker graphs on

n

vertices, we can completely characterize all the possible

(r, d)

.

Recommendations

Cites Work

Cited In (8)

This page was built for publication: The regularity and h-polynomial of Cameron-Walker graphs