Connected domination in graphs and v-numbers of binomial edge ideals
-
Jaramillo-Velez, Delio
[1]
;
Seccia, Lisa
[2]
-
[1] Centro de Investigación y de Estudios Avanzados
Centro de Investigación y de Estudios Avanzados
México
-
[2] Max Planck Institute for Mathematics in the Sciences
Max Planck Institute for Mathematics in the Sciences
Kreisfreie Stadt Leipzig, Alemania
-
- Localización: Collectanea mathematica, ISSN 0010-0757, Vol. 75, Fasc. 3, 2024, págs. 771-793
- Idioma: inglés
- DOI: 10.1007/s13348-023-00412-w
- Enlaces
-
Resumen
The 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 Jg 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 Jg behaves under Gröbner degeneration when G is a closed graph.
