Chassidy Bozeman

activity

20172022

collaborators

5 papers

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.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…