2 citations · 2 across the 1 of their papers we have counts for
1 paper
A V Jayanthan, N Narayanan, S Selvaraja
Let G be a finite simple graph and I(G) denote the corresponding edge ideal. For all s≥1, we obtain upper bounds for reg(I(G)s) for bipartite graphs. We then compare…