Chassidy Bozeman

activity

20162026

collaborators

9 papers

math.CO2026

Transmission Zero Forcing

Adam H. Berliner, Chassidy Bozeman, Karen L. Collins +3

We initiate the study of transmission zero forcing, a variant of the well-studied zero forcing graph parameter. In this variant, a subset of vertices is assigned an initial unit we…

math.CO2024

The Pinnacle Sets of a Graph

Chassidy Bozeman, Christine Cheng, Pamela E. Harris +2

We introduce and study the pinnacle sets of a simple graph $G$ with $n$ vertices. Given a bijective vertex labeling $λ : V (G) \to [n]$ , the label $λ (v)$ of vertex $v$ is a…

math.CO2022

Power domination reconfiguration

Beth Bjorkman, Chassidy Bozeman, Daniela Ferrero +5

The study of token addition and removal and token jumping reconfiguration graphs for power domination is initiated. Some results established here can be extended by applying the me…

math.AP2021

Eigenfunctions restriction estimates for curves with nonvanishing geodesic curvatures in compact Riemannian surfaces with nonpositive curvature

Chamsol Park

For $2 \leq p < 4$ , we study the $L^{p}$ norms of restrictions of eigenfunctions of the Laplace-Beltrami operator on smooth compact $2$ -dimensional Riemannian manifolds. Burq, Gérard, a…

math.CO2019

Multi-color forcing in graphs

Chassidy Bozeman, Pamela E. Harris, Neel Jain +2

Let $G = (V, E)$ be a finite connected graph along with a coloring of the vertices of $G$ using the colors in a given set $X$ . In this paper, we introduce multi-color forcing, a gener…

math.CO2018

On the tree cover number and the positive semidefinite maximum nullity of a graph

Chassidy Bozeman

For a simple graph $G = (V, E),$ let $S_{+} (G)$ denote the set of real positive semidefinite matrices $A = (a_{ij})$ such that $a_{ij} \neq = 0$ if ${i, j} \in E$ and $a_{ij} = 0$ if…

math.CO2018

Lower Bounds for the Exponential Domination Number of $C_{m} \times C_{n}$

Chassidy Bozeman, Joshua Carlson, Michael Dairyko +2

A vertex $v$ in a porous exponential dominating set assigns weight $(\frac{1}{2})^{d i s t (v, u)}$ to vertex $u$ . A porous exponential dominating set of a graph $G$ is a su…

math.CO2017

Restricted power domination and zero forcing problems

Chassidy Bozeman, Boris Brimkov, Craig Erickson +3

Power domination in graphs arises from the problem of monitoring an electric power system by placing as few measurement devices in the system as possible. A power dominating set of…

math.CO2016

On the power propagation time of a graph

Chassidy Bozeman

In this paper, we give Nordhaus-Gaddum upper and lower bounds on the sum of the power propagation time of a graph and its complement, and we consider the effects of edge subdivisio…

Transmission Zero Forcing

The Pinnacle Sets of a Graph

Power domination reconfiguration

Eigenfunctions restriction estimates for curves with nonvanishing geodesic curvatures in compact Riemannian surfaces with nonpositive curvature

Multi-color forcing in graphs

On the tree cover number and the positive semidefinite maximum nullity of a graph

Lower Bounds for the Exponential Domination Number of Cm​×Cn​

Restricted power domination and zero forcing problems

On the power propagation time of a graph

Lower Bounds for the Exponential Domination Number of $C_{m} \times C_{n}$