Induced Matchings and the v-Number of Graded Ideals
Open Access
- 11 November 2021
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 9 (22) , 2860
Abstract
We give a formula for the v-number of a graded ideal that can be used to compute this number. Then, we show that for the edge ideal of a graph G, the induced matching number of G is an upper bound for the v-number of when G is very well-covered, or G has a simplicial partition, or G is well-covered connected and contains neither four, nor five cycles. In all these cases, the v-number of is a lower bound for the regularity of the edge ring of G. We classify when the induced matching number of G is an upper bound for the v-number of when G is a cycle and classify when all vertices of a graph are shedding vertices to gain insight into the family of -graphs.
Keywords
All Related Versions
This publication has 45 references indexed in Scilit:
- Vertex decomposability and regularity of very well-covered graphsJournal of Pure and Applied Algebra, 2011
- Cohen–Macaulay, shellable and unmixed clutters with a perfect matching of König typeJournal of Pure and Applied Algebra, 2008
- Characteristic-independence of Betti numbers of graph idealsJournal of Combinatorial Theory, Series A, 2006
- On well-covered graphs of odd girth 7 or greaterDiscussiones Mathematicae Graph Theory, 2002
- A class of planar well‐covered graphs with girth fourJournal of Graph Theory, 1995
- A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cyclesJournal of Graph Theory, 1994
- On the Ideal Theory of GraphsJournal of Algebra, 1994
- A Note on Artinian Gorenstein Algebras Defined by MonomialsRocky Mountain Journal of Mathematics, 1993
- On some subclasses of well‐covered graphsJournal of Graph Theory, 1979
- On domination and independent domination numbers of a graphDiscrete Mathematics, 1978