Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Dairyko, Michael"'
A vertex $v$ in a porous exponential dominating set assigns weight $\left(\tfrac{1}{2}\right)^{dist(v,u)}$ to vertex $u$. A porous exponential dominating set of a graph $G$ is a subset of $V(G)$ such that every vertex in $V(G)$ has been assigned a su
Externí odkaz:
http://arxiv.org/abs/1803.01933
Autor:
Dairyko, Michael, Young, Michael
For a graph $G,$ the set $D \subseteq V(G)$ is a porous exponential dominating set if $1 \le \sum_{d \in D} \left( 2 \right)^{1-dist(d,v)}$ for every $v \in V(G),$ where $dist(d,v)$ denotes the length of the shortest $dv$ path. The porous exponential
Externí odkaz:
http://arxiv.org/abs/1801.06404
Autor:
Dairyko, Michael, Young, Michael
For a graph $G,$ we consider $D \subset V(G)$ to be a porous exponential dominating set if $1\le \sum_{d \in D}$ $\left( \frac{1}{2} \right)^{\text{dist}(d,v) -1}$ for every $v \in V(G),$ where dist$(d,v)$ denotes the length of the smallest $dv$ path
Externí odkaz:
http://arxiv.org/abs/1712.05429
Autor:
Dairyko, Michael, Ferrara, Michael, Lidický, Bernard, Martin, Ryan R., Pfender, Florian, Uzzell, Andrew J.
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 vertex becomes active if at any stage it has at least $r$ active neig
Externí odkaz:
http://arxiv.org/abs/1610.04499
Autor:
Dairyko, Michael, Hogben, Leslie, Lin, Jephian C. -H., Lockhart, Joshua, Roberson, David, Severini, Simone, Young, Michael
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 that connected graphs of order $n$ have R\'enyi 2-entropy at least as g
Externí odkaz:
http://arxiv.org/abs/1609.00420
Autor:
Berikkyzy, Zhanar, Cox, Christopher, Dairyko, Michael, Hogenson, Kirsten, Kumbhat, Mohit, Lidický, Bernard, Messerschmidt, Kacy, Moss, Kevin, Nowak, Kathleen, Palmowski, Kevin F., Stolee, Derrick
Publikováno v:
Graphs and Combinatorics 33 (2017) 751-787
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 lists of size four has received significant attention. In terms of constr
Externí odkaz:
http://arxiv.org/abs/1512.03787
Autor:
Beck, Matthias, Berrizbeitia, Ana, Dairyko, Michael, Rodriguez, Claudia, Ruiz, Amanda, Veeneman, Schuyler
Publikováno v:
American Math. Monthly 122 (2015), 660-673
The \emph{Shi arrangement} is the set of all hyperplanes in $\mathbb R^n$ of the form $x_j - x_k = 0$ or $1$ for $1 \le j < k \le n$. Shi observed in 1986 that the number of regions (i.e., connected components of the complement) of this arrangement i
Externí odkaz:
http://arxiv.org/abs/1405.5587
Our aim in this note is to present four remarkable facts about quotient sets. These observations seem to have been overlooked by the Monthly, despite its intense coverage of quotient sets over the years.
Comment: 9 pages, to appear in the Americ
Comment: 9 pages, to appear in the Americ
Externí odkaz:
http://arxiv.org/abs/1312.1036
In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare these resul
Externí odkaz:
http://arxiv.org/abs/1203.0795
Autor:
Dairyko, Michael, Hogben, Leslie, Lin, Jephian C.-H., Lockhart, Joshua, Roberson, David, Severini, Simone, Young, Michael
Publikováno v:
In Linear Algebra and Its Applications 15 May 2017 521:240-253
