Lattice points arising from regularity and $\mathrm{v}$-number of Graphs: Whisker and Cameron-Walker
Prativa Biswas, Mousumi Mandal, Kamalesh Saha

TL;DR
This paper explores the relationship between regularity and v-number of edge ideals of graphs, establishing bounds and explicitly characterizing pairs for special graph classes like whisker and Cameron-Walker graphs.
Contribution
It introduces the set of lattice points from regularity and v-number pairs, provides bounds, and characterizes these pairs for specific graph classes, also proposing a conjecture for chordal graphs.
Findings
Established bounds for the set of lattice points from regularity and v-number pairs.
Explicitly characterized pairs for whisker and Cameron-Walker graphs.
Proposed a conjecture for connected chordal graphs.
Abstract
Let be a simple graph on vertices and be its edge ideal. In this paper, we initiate the study of determining lattice points in that appear as a pair , where ranges over all connected graphs on vertices, and we denote this set by . Here `' denotes the (Castelnuovo-Mumford) regularity and `' denotes the -number. We establish general bounds for by identifying two sets and satisfying . Furthermore, we explicitly determine the subsets of consisting of all possible pairs arising from whisker graphs and Cameron-Walker graphs on vertices. Finally, we propose a conjecture on the subset of …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Coding theory and cryptography · Interconnection Networks and Systems
