The v-number and Castelnuovo-Mumford regularity of graphs

2022/04/21 by Yusuf Civan, Civan, Yusuf · 3 citations
Chemistry · Mathematics · Neuroscience · #Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics #Graph theory and applications #Metal-Organic Frameworks: Synthesis and Applications #Nuclear Receptors and Signaling

paper · pdf · doi:10.48550/arxiv.2204.10317

openalex publication_date 2022/04/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We prove that for every integer k≥ 1, there exists a connected graph H_k such that v(H_k)=reg(H_k)+k, where v(G) and reg(G) denote the v-number and the (Castelnuovo-Mumford) regularity of a graph G respectively.

Cited by

• v-numbers of integral closure filtrations of monomial ideals
• Comparing the v-number and h-polynomials of edge ideals
• The V-Number of Binomial Edge Ideals: Minimal Cuts and Cycle Graphs

Related

• Castelnuovo-Mumford regularity of graphs
• Bounding Castelnuovo-Mumford regularity of graphs via Lozin's transformation
• Regularity, matchings and Cameron-Walker graphs
• Regularity of bicyclic Graphs and their powers
• Matchings in hypergraphs and Castelnuovo-Mumford regularity