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

9 papers

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)…

math.CO2017

On exponential domination of the consecutive circulant graph

Michael Dairyko, Michael Young

For a graph $G,$ we consider $D \subset V (G)$ to be a porous exponential dominating set if $1 \leq \sum_{d \in D}$ $(\frac{1}{2})^{dist (d, v) - 1}$ for every $v \in…

math.CO2016★ 4 cited

Ore and Chvátal-type Degree Conditions for Bootstrap Percolation from Small Sets

Michael Dairyko, Michael Ferrara, Bernard Lidický +3

Bootstrap percolation is a deterministic cellular automaton in which vertices of a graph~ $G$ begin in one of two states, "dormant" or "active". Given a fixed integer $r$ , a dormant…

math.CO2016

Note on von Neumann and Rényi entropies of a Graph

Michael Dairyko, Leslie Hogben, Jephian C. -H. Lin +4

We conjecture that all connected graphs of order $n$ have von Neumann entropy at least as great as the star $K_{1, n - 1}$ and prove this for almost all graphs of order $n$ . We show t…

math.CO2015★ 7 cited

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

Zhanar Berikkyzy, Christopher Cox, Michael Dairyko +8

All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lis…