Michael Dairyko

activity

20122018

most cited(4,2)-choosability of planar graphs with forbidden structures

7 citations · 13 across the 7 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018

Lower Bounds for the Exponential Domination Number of $C_{m} \times C_{n}$

Chassidy Bozeman, Joshua Carlson, Michael Dairyko +2

A vertex $v$ in a porous exponential dominating set assigns weight $(\frac{1}{2})^{d i s t (v, u)}$ to vertex $u$ . A porous exponential dominating set of a graph $G$ is a su…

math.CO2018

A linear programming method for exponential domination

Michael Dairyko, Michael Young

For a graph $G,$ the set $D \subseteq V (G)$ is a porous exponential dominating set if $1 \leq \sum_{d \in D} (2)^{1 - d i s t (d, v)}$ for every $v \in V (G),$ where $dist(d,v)…

Lower Bounds for the Exponential Domination Number of Cm​×Cn​

A linear programming method for exponential domination

Lower Bounds for the Exponential Domination Number of $C_{m} \times C_{n}$