Lattice points arising from regularity and -number of Graphs: Whisker and Cameron-Walker
arXiv:2603.04876
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 arising from connected chordal graphs.
arXiv comment20 pages, 5 figures