Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Curl, Emelie"'
In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe vertices such that the non-probe vertices form an independent set. In g
Externí odkaz:
http://arxiv.org/abs/2402.18670
Autor:
Allred, Sarah, Curl, Emelie, Fallat, Shaun, Nasserasr, Shahla, Schuerger, Houston, Villagrán, Ralihe R., Vishwakarma, Prateek K.
The utility of a matrix satisfying the Strong Spectral Property has been well established particularly in connection with the inverse eigenvalue problem for graphs. More recently the class of graphs in which all associated symmetric matrices possess
Externí odkaz:
http://arxiv.org/abs/2303.17138
Motivated in part by an observation that the zero forcing number for the complement of a tree on $n$ vertices is either $n-3$ or $n-1$ in one exceptional case, we consider the zero forcing number for the complement of more general graphs under some c
Externí odkaz:
http://arxiv.org/abs/2206.03932
Publikováno v:
In Linear Algebra and Its Applications 15 December 2024 703:187-207
If $S$ is a subset of an abelian group $G$, the polychromatic number of $S$ in $G$ is the largest integer $k$ so that there is a $k-$coloring of the elements of $G$ such that every translate of $S$ in $G$ gets all $k$ colors. We determine the polychr
Externí odkaz:
http://arxiv.org/abs/2007.14468
Zero forcing is a process that colors the vertices of a graph blue by starting with some vertices blue and applying a color change rule. Throttling minimizes the sum of the number of initial blue vertices and the time to color the graph. In this pape
Externí odkaz:
http://arxiv.org/abs/1909.07235
Autor:
Chan, Yu, Curl, Emelie, Geneson, Jesse, Hogben, Leslie, Liu, Kevin, Odegard, Issac, Ross, Michael S.
Zero forcing is a coloring game played on a graph where each vertex is initially colored blue or white and the goal is to color all the vertices blue by repeated use of a (deterministic) color change rule starting with as few blue vertices as possibl
Externí odkaz:
http://arxiv.org/abs/1906.11083
The Kaczmarz algorithm is an iterative method for solving a system of linear equations. It can be extended so as to reconstruct a vector $x$ in a (separable) Hilbert space from the inner-products $\{\langle x, \phi_{n} \rangle\}$. The Kaczmarz algori
Externí odkaz:
http://arxiv.org/abs/1811.00169
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.
Autor:
Curl, Emelie1 (AUTHOR) curlej@hollins.edu, Goldwasser, John1 (AUTHOR), Sampson, Joe1 (AUTHOR), Young, Michael1 (AUTHOR)
Publikováno v:
Graphs & Combinatorics. Jun2022, Vol. 38 Issue 3, p1-12. 12p.