Showing math.COShow all
3 papers · 1 filter
math.CO2025
IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
Thomas R. Cameron, Jonad Pulaj
Zero forcing is a binary coloring game on a graph where a set of filled vertices can force non-filled vertices to become filled following a color change rule. In 2008, the zero for…
math.CO2024
Bilevel Programming for Pebbling Numbers of Lemke Graph Products
Jonad Pulaj, Kenan Wood, Carl Yerger
Given a configuration of indistinguishable pebbles on the vertices of a graph, a pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacen…
math.CO2024
Local Configurations in Union-Closed Families
Jonad Pulaj, Kenan Wood
The Frankl or Union-Closed Sets conjecture states that for any finite union-closed family of sets containing some nonempty set, there is some element in the groun…