1 citations · 1 across the 7 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.CO2022
Graph Coloring as a Measure of Network Vulnerability
Mia Destefano, Grace Mulry, Mason Nakamura +2
We consider new parameters for conditional network vulnerability related to graph coloring. We define a network to be in operation if the chromatic number (or index) is greater tha…
math.CO2022
Generalized Bondage Number: The -synchronous bondage number of a graph
Rey Anaya, Alvaro Belmonte, Nathan Shank +2
We investigate a generalization of the bondage number of a graph called the \textit{-synchronous bondage number}. The -synchronous bondage number of a graph is the smalle…
math.CO2022
Clumsy Packing of Polyominoes in Finite Space
Emma Miller, Mitchel O'Connor, Nathan Shank
Clumsy packing is considered an inefficient packing, meaning we find the minimum number of objects we can pack into a space so that we can not pack any more object. Thus we are eff…