We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
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.
