WorksMathematics
The -number of -closed neighborhood ideals
Abstract
We give a combinatorial characterization of the -number of a -closed neighborhood ideal associated to a graph , and investigate its relation with other invariants such as the -domination number and the smallest size of a ball of radius in the graph . We present several new cases where it is satisfied that the -number is bounded above by the Castelnuovo-Mumford regularity. We analyze the behavior of the -number of a -closed neighborhood ideal with respect to the parameter . Lastly, we compute explicit formulas for the -number in the case of paths, cycles, and caterpillars, and analyze the case of Hamming graphs.