Emelie Curl
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Emelie Curl has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Shaun Fallat
Department of Mathematics and Statistics, University of Regina, Saskatchewan, Canada
3 shared publications - Carolyn Reinhart
Department of Mathematics and Statistics Swarthmore College Swarthmore PA USA
2 shared publications - Houston Schuerger
Department of Mathematics Trinity College Hartford CT USA
2 shared publications - Prateek Kumar Vishwakarma
Département de mathématiques et de statistique Université Laval Quebec City Quebec Canada
2 shared publications - Ralihe Raul Villagrán
Worcester Polytechnic Institute
2 shared publications - Shahla Nasserasr
School of Mathematical Sciences Rochester Institute of Technology Rochester NY
2 shared publications
Latest Publications
- Open Access
The inverse eigenvalue problem for probe graphs
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 general, a probe graph is used to represent the set of graphs that can be obtained by adding edges between non-probe vertices. The inverse eigenvalue problem for a graph considers a family of matrices whose zero-nonzero pattern is defined by the graph and asks which spectra are achievable by matrices in this family. We ask the same question for probe graphs. We start by establishing bounds on the maximum nullity for probe graphs and defining the probe graph zero forcing number. Next, we focus on graphs of two parallel paths, the unique family of graphs whose (standard) zero forcing number is two. We partially characterize the probe graph zero forcing number of such graphs and prove some necessary structural results about the family. Finally, we characterize probe graphs whose minimum rank is $0, 1, 2, n-2,$ and $n-1$.Open AccessThe inverse eigenvalue problem for probe graphs
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 general, a probe graph is used to represent the set of graphs that can be obtained by adding edges between non-probe vertices. The inverse eigenvalue problem for a graph considers a family of matrices whose zero-nonzero pattern is defined by the graph and asks which spectra are achievable by matrices in this family. We ask the same question for probe graphs. We start by establishing bounds on the maximum nullity for probe graphs and defining the probe graph zero forcing number. Next, we focus on graphs of two parallel paths, the unique family of graphs whose (standard) zero forcing number is two. We partially characterize the probe graph zero forcing number of such graphs and prove some necessary structural results about the family. Finally, we characterize probe graphs whose minimum rank is $0, 1, 2, n-2,$ and $n-1$. - 6 February 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (2) , 1-25
The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions
- 6 February 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (2) , 1-25
The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions
- Open Access
The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions
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 the Strong Spectral Property (denoted $G^{SSP}$) were studied, and along these lines we aim to study properties of graphs that exhibit a so-called barbell partition. Such a partition is a known impediment to membership in the class $G^{SSP}$. In particular we consider the existence of barbell partitions under various standard and useful graph operations.Open AccessThe Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions
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 the Strong Spectral Property (denoted $G^{SSP}$) were studied, and along these lines we aim to study properties of graphs that exhibit a so-called barbell partition. Such a partition is a known impediment to membership in the class $G^{SSP}$. In particular we consider the existence of barbell partitions under various standard and useful graph operations. - Open Access
On the zero forcing number of the complement of graphs with forbidden subgraphs
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 conditions, particularly those that do not contain complete bipartite subgraphs. We also move well beyond trees and completely study all of the possible zero forcing numbers for the complements of unicyclic graphs and cactus graphs.Open AccessOn the zero forcing number of the complement of graphs with forbidden subgraphs
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 conditions, particularly those that do not contain complete bipartite subgraphs. We also move well beyond trees and completely study all of the possible zero forcing numbers for the complements of unicyclic graphs and cactus graphs. - 29 July 2022
- Published by Taylor & Francis in The College Mathematics Journal
- Vol. 53 (4) , 273-281
Exploring Combinatorics and Graph Theory with Simple Blokus
Summary In this article, we examine a simplified version of the game Blokus. We count the number of completed boards in this game, discussing how the count can be examined in terms of both combinatorics and graph theory, and provide takeaways for undergraduate mathematics.
- 29 July 2022
- Published by Taylor & Francis in The College Mathematics Journal
- Vol. 53 (4) , 273-281
Exploring Combinatorics and Graph Theory with Simple Blokus
Summary In this article, we examine a simplified version of the game Blokus. We count the number of completed boards in this game, discussing how the count can be examined in terms of both combinatorics and graph theory, and provide takeaways for undergraduate mathematics.
- Open Access
- 14 March 2022
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (3) , 1-12
The Polychromatic Number of Small Subsets of the Integers Modulo n
- 14 March 2022
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (3) , 1-12
Open AccessThe Polychromatic Number of Small Subsets of the Integers Modulo n