Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Natalie C. Behague"'
Publikováno v:
The Electronic Journal of Combinatorics. 29
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:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd64eda71b876e67e8cedb10e68211b9
https://doi.org/10.37236/10585
https://doi.org/10.37236/10585
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c07be583b4339e61a135a8c0d258d09e
http://arxiv.org/abs/2101.12560
http://arxiv.org/abs/2101.12560
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a84bd49d11528a9d82c322b8ea1252b
Autor:
Natalie C. Behague
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bffaf522f6e8b1b218b1a410c711d98f
Autor:
Natalie C. Behague
A 1-factorization M = { M 1 , M 2 , … , M n } of a graph G is called perfect if the union of any pair of 1-factors M i , M j with i ≠ j is a Hamilton cycle. It is called k -semi-perfect if the union of any pair of 1-factors M i , M j with 1 ≤ i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bc2922cbdd886a0b193f4ed2ebf2445