REGULARITY of POWERS of BIPARTITE GRAPHS

Abstract

For a simple bipartite graph G, we give an upper bound for the regularity of powers of the edge ideal I(G) in terms of its vertex domination number. Consequently, we explicitly compute the regularity of powers of the edge ideal of a bipartite Kneser graph. Further, we compute the induced matching number of a bipartite Kneser graph. © The Author(s), 2022. Published by Cambridge University Press on behalf of Australian Mathematical Publishing Association Inc.