An r-fold analogue of the positive semidefinite zero forcing process that is carried out on the r-blowup of a graph is introduced and used to define the fractional positive semidefinite forcing number. Properties of the graph blowup when colored with a fractional positive semidefinite forcing set are examined and used to define a three-color forcing game that directly computes the fractional positive semidefinite forcing number of a graph. We develop a fractional parameter based on the standard zero forcing process and it is shown that this parameter is exactly the skew zero forcing number with a three-color approach. This approach and an algorithm are used to characterize graphs whose skew zero forcing number equals zero
Consider a graph where some of its vertices are colored. A colored vertex with a single uncolored ne...
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a gra...
Zero forcing is a coloring game played on a graph where each vertex is initially colored blue or whi...
This thesis applies techniques from fractional graph theory to develop fractional versio...
The positive semidefinite zero forcing number Z+(G) of a graph G was introduced in [4]. We establish...
Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices...
Zero forcing number and positive semidefinite zero forcing number are important parameters in studyi...
Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices ...
Zero forcing is a process on a graph that colors vertices blue by starting with some of the vertices...
Let G be a simple undirected graph with each vertex colored either white or black, u be a black vert...
Zero forcing is a combinatorial game played on graphs in which a color change rule is used to progre...
This work was also published as a Rice University thesis/dissertation.This thesis investigates sever...
The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we giv...
In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial ...
AbstractThe zero forcing number of a graph is the minimum size of a zero forcing set. This parameter...
Consider a graph where some of its vertices are colored. A colored vertex with a single uncolored ne...
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a gra...
Zero forcing is a coloring game played on a graph where each vertex is initially colored blue or whi...
This thesis applies techniques from fractional graph theory to develop fractional versio...
The positive semidefinite zero forcing number Z+(G) of a graph G was introduced in [4]. We establish...
Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices...
Zero forcing number and positive semidefinite zero forcing number are important parameters in studyi...
Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices ...
Zero forcing is a process on a graph that colors vertices blue by starting with some of the vertices...
Let G be a simple undirected graph with each vertex colored either white or black, u be a black vert...
Zero forcing is a combinatorial game played on graphs in which a color change rule is used to progre...
This work was also published as a Rice University thesis/dissertation.This thesis investigates sever...
The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we giv...
In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial ...
AbstractThe zero forcing number of a graph is the minimum size of a zero forcing set. This parameter...
Consider a graph where some of its vertices are colored. A colored vertex with a single uncolored ne...
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a gra...
Zero forcing is a coloring game played on a graph where each vertex is initially colored blue or whi...