Brimkov’s articles published in algebra and computing journals
October 27, 2022
Boris Brimkov, a Slippery Rock University assistant professor of mathematics and statistics, recently wrote two peer-reviewed papers that were published in algebra and computing journals.
Brimkov’s article “Constructions of cospectral graphs with different zero forcing numbers,” published in the Electronic Journal of Linear Algebra, showed that certain functions defined on networks cannot be computed using limited information about the networks. “Computational and theoretical challenges for computing the minimum rank of a graph,” published in INFORMS Journal on Computing, presented a new way to obtain an approximate solution to a computationally difficult problem from linear algebra in terms of a more tractable problem from matroid theory.