Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Ryan Pepper"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 3, p 619 (2023)
Externí odkaz:
https://doaj.org/article/4d1fc8a8762540358228475419bc330c
Autor:
Yair Caro, Ryan Pepper
Publikováno v:
Theory and Applications of Graphs, Vol 6, Iss 1, Pp 1-11 (2019)
The \emph{maximum oriented $k$-forcing number} of a simple graph $G$, written $\MOF_k(G)$, is the maximum \emph{directed $k$-forcing number} among all orientations of $G$. This invariant was recently introduced by Caro, Davila and Pepper in~\cite{Car
Externí odkaz:
https://doaj.org/article/4feda73e79a545f39afe32d102e4cf0c
Autor:
Marc-Antonio Bisotti, David Cortés-Ortuño, Ryan Pepper, Weiwei Wang, Marijan Beg, Thomas Kluyver, Hans Fangohr
Publikováno v:
Journal of Open Research Software, Vol 6, Iss 1 (2018)
Fidimag is an open-source scientific code for the study of magnetic materials at the nano- or micro-scale using either atomistic or finite difference micromagnetic simulations, which are based on solving the Landau-Lifshitz-Gilbert equation. In addit
Externí odkaz:
https://doaj.org/article/84e2407e445b43889abc8f6d78f1458a
Autor:
David Cortés-Ortuño, Marijan Beg, Vanessa Nehruji, Leoni Breth, Ryan Pepper, Thomas Kluyver, Gary Downing, Thorsten Hesjedal, Peter Hatton, Tom Lancaster, Riccardo Hertel, Ondrej Hovorka, Hans Fangohr
Publikováno v:
New Journal of Physics, Vol 20, Iss 11, p 113015 (2018)
Understanding the role of the Dzyaloshinskii–Moriya interaction (DMI) for the formation of helimagnetic order, as well as the emergence of skyrmions in magnetic systems that lack inversion symmetry, has found increasing interest due to the signific
Externí odkaz:
https://doaj.org/article/e41db7a756a548e3a969928bcbe0c7bb
Autor:
Yair Caro, Ryan Pepper
Publikováno v:
Theory and Applications of Graphs, Vol 2, Iss 2 (2015)
The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we give a greedy algorithm to approximate the k-forcing number of a graph. Using this dynamic approach, we give corollaries which improve upon two theorems
Externí odkaz:
https://doaj.org/article/c8a9e9caa7484cbaab13910c263530bc
Publikováno v:
Discrete Applied Mathematics. 262:42-55
This article studies the k -forcing number for oriented graphs, generalizing both the zero forcing number for directed graphs and the k -forcing number for simple graphs. In particular, given a simple graph G , we introduce the maximum (minimum) orie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e09cbb00cdb1ec8a3ec4b49fdeba7da
https://doi.org/10.1016/j.dam.2019.02.004
https://doi.org/10.1016/j.dam.2019.02.004
Publikováno v:
Discussiones Mathematicae Graph Theory.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fba6ce4850369f01063d9838dfca59fa
https://doi.org/10.7151/dmgt.2389
https://doi.org/10.7151/dmgt.2389
Publikováno v:
Graphs and Combinatorics. 34:1159-1174
In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph. We provide sharp upper and lower bounds on the connected forcing numbe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a01f4c80388ceaea6c42a70051ae0909
https://doi.org/10.1007/s00373-018-1957-x
https://doi.org/10.1007/s00373-018-1957-x
Publikováno v:
International Journal of Operational Research. 1:1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b59c7d3ab22e46f7bb8733f85b57c97c
https://doi.org/10.1504/ijor.2021.10044729
https://doi.org/10.1504/ijor.2021.10044729
Publikováno v:
Discussiones Mathematicae Graph Theory. 42:921
In this paper we study relationships between the \emph{matching number}, written $\mu(G)$, and the \emph{independence number}, written $\alpha(G)$. Our first main result is to show \[ \alpha(G) \le \mu(G) + |X| - \mu(G[N_G[X]]), \] where $X$ is \emph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09ba4660514ac35762ff8fbe21e2c180
https://doi.org/10.7151/dmgt.2317
https://doi.org/10.7151/dmgt.2317