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 I(G) of a graph G, the induced matching number of G is an upper bound for the v-number of I(G) 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 I(G) 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 I(G) when G is a cycle and classify when all vertices of a graph are shedding vertices to gain insight into the family of W2-graphs.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference57 articles.
1. Generalized minimum distance functions and algebraic invariants of Geramita ideals
2. Macaulay2http://www.math.uiuc.edu/Macaulay2/
3. The dual of an evaluation code
4. The v-number of edge ideals
5. Footprint and minimum distance functions;Núñez-Betancourt;Commun. Korean Math. Soc.,2018
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献