Dominating induced matchings of finite graphs and regularity of edge ideals

Takayuki Hibi, Akihiro Higashitani, Kyouko Kimura +1

The regularity of an edge ideal of a finite simple graph $G$ is at least the induced matching number of $G$ and is at most the minimum matching number of $G$. If $G$ possesses a do…