Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Behague, Natalie C."'
Autor:
Behague, Natalie C., Bonato, Anthony, Huggan, Melissa A., Marbach, Trent G., Pittman, Brittany
The localization game is a pursuit-evasion game analogous to Cops and Robbers, where the robber is invisible and the cops send distance probes in an attempt to identify the location of the robber. We present a novel graph parameter called the capture
Externí odkaz:
http://arxiv.org/abs/2105.09806
The semi-random graph process is a single-player game that begins with an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the player independently and uniformly at random. The player then adaptively selects a vertex $v$ and a
Externí odkaz:
http://arxiv.org/abs/2105.07034
Complex networks are pervasive in the real world, capturing dyadic interactions between pairs of vertices, and a large corpus has emerged on their mining and modeling. However, many phenomena are comprised of polyadic interactions between more than t
Externí odkaz:
http://arxiv.org/abs/2101.12560
Zero forcing is a deterministic iterative graph colouring process in which vertices are coloured either blue or white, and in every round, any blue vertices that have a single white neighbour force these white vertices to become blue. Here we study p
Externí odkaz:
http://arxiv.org/abs/2012.00216
An automaton is synchronizing if there is a word that maps all states onto the same state. \v{C}ern\'{y}'s conjecture on the length of the shortest such word is probably the most famous open problem in automata theory. We consider the closely related
Externí odkaz:
http://arxiv.org/abs/2008.12166
Publikováno v:
In Discrete Applied Mathematics 15 October 2023 337:106-119
Autor:
Behague, Natalie C.
A 1-factorization $\mathcal{M} = \{M_1,M_2,\ldots,M_n\}$ of a graph $G$ is called perfect if the union of any pair of 1-factors $M_i, M_j$ with $i \ne j$ is a Hamilton cycle. It is called $k$-semi-perfect if the union of any pair of 1-factors $M_i, M
Externí odkaz:
http://arxiv.org/abs/1811.06389
Autor:
Behague, Natalie C.
Let $\mathcal{F}$ be a family of $r$-graphs. An $r$-graph $G$ is called $\mathcal{F}$-saturated if it does not contain any members of $\mathcal{F}$ but adding any edge creates a copy of some $r$-graph in $\mathcal{F}$. The saturation number $\operato
Externí odkaz:
http://arxiv.org/abs/1803.05799
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.