Dominating induced matchings of finite graphs and regularity of edge ideals
この論文をさがす
説明
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 dominating inuduced matching, i.e., an induced matching which forms a maximal matching, then the induced matching number of $G$ is equal to the minimum matching number of $G$. In the present paper, from viewpoints of both combinatorics and commutative algebra, finite simple graphs with dominating induced matchings will be mainly studied.
23 pages, v2:minor changes, to appear in Journal of Algebraic Combinatorics
収録刊行物
-
- Journal of Algebraic Combinatorics
-
Journal of Algebraic Combinatorics 43 (1), 173-198, 2015-09-02
Springer Science and Business Media LLC
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1360848656297789056
-
- ISSN
- 15729192
- 09259899
-
- 資料種別
- journal article
-
- データソース種別
-
- Crossref
- KAKEN
- OpenAIRE