2 citations · 6 across the 5 of their papers we have counts for
11 papers · 1 filter
Computer assisted discovery: Zero forcing vs vertex cover
Boris Brimkov, Randy Davila, Houston Schuerger +1
In this paper, we showcase the process of using an automated conjecturing program called \emph{TxGraffiti} written and maintained by the second author. We begin by proving a conjec…
Minimal Zero Forcing Sets
Boris Brimkov, Joshua Carlson
In this paper, we study minimal (with respect to inclusion) zero forcing sets. We first investigate when a graph can have polynomially or exponentially many distinct minimal zero f…
An exact algorithm for the minimum rank of a graph
Boris Brimkov, Zachary Scherr
The minimum rank of a graph G is the minimum rank over all real symmetric matrices whose off-diagonal sparsity pattern is the same as that of the adjacency matrix of G. In this not…
Optimizing the trade-off between number of cops and capture time in Cops and Robbers
Anthony Bonato, Jane Breen, Boris Brimkov +6
The cop throttling number of a graph for the game of Cops and Robbers is the minimum of , where is the number of cops and is the minimu…
Graphs that are cospectral for the distance Laplacian
Boris Brimkov, Ken Duna, Leslie Hogben +4
The distance matrix of a graph is the matrix containing the pairwise distances between vertices, and the distance Laplacian matrix is $\mathcal{D}^L(G)=T(G)-\m…
On the status sequences of trees
Aida Abiad, Boris Brimkov, Alexander Grigoriev
The status of a vertex in a connected graph is the sum of the distances from to all other vertices. The status sequence of a connected graph is the list of the statuses of…