Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Meddaugh, Jonathan"'
Autor:
Erickson, William Q., Herden, Daniel, Meddaugh, Jonathan, Sepanski, Mark R., Minyard, Mitchell, Rosengartner, Kyle
Given a finite simple graph $G$, let $\operatorname{M}(G)$ denote its 2-distance graph, in which two vertices are adjacent if and only if they have distance 2 in $G$. In this paper, we consider the periodic behavior of the sequence $G, \operatorname{
Externí odkaz:
http://arxiv.org/abs/2409.02306
A vertex coloring of a graph is said to be pseudocomplete if, for any two distinct colors, there exists at least one edge with those two colors as its end vertices. The pseudoachromatic number of a graph is the greatest number of colors possible used
Externí odkaz:
http://arxiv.org/abs/2408.16739
Autor:
Erickson, William Q., Herden, Daniel, Meddaugh, Jonathan, Sepanski, Mark R., Hammon, Cordell, Mohn, Jasmin, Ruiz-Bolanos, Indalecio
The tableau reconstruction problem, posed by Monks (2009), asks the following. Starting with a standard Young tableau $T$, a 1-minor of $T$ is a tableau obtained by first deleting any cell of $T$, and then performing jeu de taquin slides to fill the
Externí odkaz:
http://arxiv.org/abs/2307.13161
In this paper, we demonstrate conditions under which a Lindel\"{o}f dynamical system exhibits $\omega$-chaos. In particular, if a system exhibits a generalized version of the specification property and has at least three points with mutually separate
Externí odkaz:
http://arxiv.org/abs/2305.16168
Autor:
Erickson, William Q., Herden, Daniel, Meddaugh, Jonathan, Sepanski, Mark R., Echols, Isaac, Hammon, Cordell, Marchena-Menendez, Jorge, Mohn, Jasmin, Radillo-Murguia, Blanca, Ruiz-Bolanos, Indalecio
For a graph $G$ and an abelian group $A$, a labeling of the vertices of $G$ induces a labeling of the edges via the sum of adjacent vertex labels. Hovey introduced the notion of an $A$-cordial vertex labeling when both the vertex and edge labels are
Externí odkaz:
http://arxiv.org/abs/2211.10044
Autor:
Erickson, William Q., Herden, Daniel, Meddaugh, Jonathan, Sepanski, Mark R., Hammon, Cordell, Mohn, Jasmin, Ruiz-Bolanos, Indalecio
Publikováno v:
In Journal of Combinatorial Theory, Series A January 2025 209
Autor:
Herden, Daniel, Meddaugh, Jonathan, Sepanski, Mark, Echols, Isaac, Garcia-Montoya, Nina, Hammon, Cordell, Huang, Guanjie, Kraus, Adam, Menendez, Jorge Marchena, Mohn, Jasmin, Jiménez, Rafael Morales
The vertex-edge marking game is played between two players on a graph, $G=(V,E)$, with one player marking vertices and the other marking edges. The players want to minimize/maximize, respectively, the number of marked edges incident to an unmarked ve
Externí odkaz:
http://arxiv.org/abs/2201.03633
Autor:
Herden, Daniel, Meddaugh, Jonathan, Sepanski, Mark, Echols, Isaac, Garcia-Montoya, Nina, Hammon, Cordell, Huang, Guanjie, Kraus, Adam, Menendez, Jorge Marchena, Mohn, Jasmin, Jiménez, Rafael Morales
The $P_3$-hull number of a graph is the minimum cardinality of an infecting set of vertices that will eventually infect the entire graph under the rule that uninfected nodes become infected if two or more neighbors are infected. In this paper, we stu
Externí odkaz:
http://arxiv.org/abs/2201.00078
Autor:
Meddaugh, Jonathan
In this paper we examine the interplay between recurrence properties and the shadowing property in dynamical systems on compact metric spaces. In particular, we demonstrate that if the dynamical system $(X,f)$ has shadowing, then it is recurrent if a
Externí odkaz:
http://arxiv.org/abs/2111.10424
Autor:
Meddaugh, Jonathan
We demonstrate that there is a large class of compact metric spaces for which the shadowing property can be characterized as a structural property of the space of dynamical systems. We also demonstrate for this class of spaces, that in order to deter
Externí odkaz:
http://arxiv.org/abs/2106.01957