Abstract
AbstractThe v-number of a graded ideal is an algebraic invariant introduced by Cooper et al., and originally motivated by problems in algebraic coding theory. In this paper we study the case of binomial edge ideals and we establish a significant connection between their v-numbers and the concept of connected domination in graphs. More specifically, we prove that the localization of the v-number at one of the minimal primes of the binomial edge ideal $$J_G$$
J
G
of a graph G coincides with the connected domination number of the defining graph, providing a first algebraic description of the connected domination number. As an immediate corollary, we obtain a sharp combinatorial upper bound for the v-number of binomial edge ideals of graphs. Lastly, building on some known results on edge ideals, we analyse how the v-number of $$J_G$$
J
G
behaves under Gröbner degeneration when G is a closed graph.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics
Reference44 articles.
1. Ambhore, S.B., Saha K., Sengupta, I.: The v-number of binomial edge ideals. arXiv:2304.06416 (2023)
2. Bo, C., Liu, B.: Some inequalities about connected domination number. Discrete Math. 159(1), 241–245 (1996)
3. Civan, Y.: The $$v$$-number and Castelnuovo–Mumford regularity of graphs. J. Algebraic Combin. 57(1), 161–169 (2023)
4. Cooper, S.M., Seceleanu, A., Tohăneanu, ŞO., Pinto, M.V., Villarreal, R.H.: Generalized minimum distance functions and algebraic invariants of Geramita ideals. Adv. Appl. Math. 112, 101940 (2020)
5. Caro, Y., West, D.B., Yuster, R.: Connected domination and spanning trees with many leaves. SIAM J. Discrete Math. 13(2), 202–211 (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献