English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

The regularity of an edge ideal of a finite simple graph $G$ is at least theinduced matching number of $G$ and is at most the minimum matching number of$G$. If $G$ possesses a dominating inuduced matching, i.e., an induced matchingwhich forms a maximal matching, then the induced matching number of $G$ isequal to the minimum matching number of $G$. In the present paper, fromviewpoints of both combinatorics and commutative algebra, finite simple graphswith dominating induced matchings will be mainly studied.

Dominating induced matchings of finite graphs and regularity of edge ideals