Abstract
The regularity of an edge ideal of a finite simple graph is at least the induced matching number of and is at most the minimum matching number of . If possesses a dominating inuduced matching, i.e., an induced matching which forms a maximal matching, then the induced matching number of is equal to the minimum matching number of . In the present paper, from viewpoints of both combinatorics and commutative algebra, finite simple graphs with dominating induced matchings will be mainly studied.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.