Dominating induced matchings of finite graphs and regularity of edge ideals

preprint2015arXivOpen access

Abstract

The regularity of an edge ideal of a finite simple graph GG is at least the induced matching number of GG and is at most the minimum matching number of GG. If GG possesses a dominating inuduced matching, i.e., an induced matching which forms a maximal matching, then the induced matching number of GG is equal to the minimum matching number of GG. In the present paper, from viewpoints of both combinatorics and commutative algebra, finite simple graphs with dominating induced matchings will be mainly studied.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.