Boris Brimkov

activity

20152025

most citedGraphs with Extremal Connected Forcing Numbers

2 citations · 6 across the 8 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019★ 2 cited

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…

math.CO2019

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 $t h_{c} (G)$ of a graph $G$ for the game of Cops and Robbers is the minimum of $k + c a p t_{k} (G)$ , where $k$ is the number of cops and $c a p t_{k} (G)$ is the minimu…