Boris Brimkov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Boris Brimkov has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Aida Abiad
Eindhoven University of Technology, Vrije Universiteit Brussel
2 shared publications - Antonina P. Khramova
Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
1 shared publication - Carolyn Reinhart
Department of Mathematics and Statistics Swarthmore College Swarthmore PA USA
1 shared publication - Himanshu Gupta
University of Regina Regina Saskatchewan Canada
1 shared publication - Jack H. Koolen
School of Mathematical Sciences University of Science and Technology of China 230026 Hefei People's Republic of China
1 shared publication Jane Breen
Ontario Tech University
1 shared publication
Latest Publications
- 21 March 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1073
Throttling for metric dimension and its variants
- 21 March 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1073
Throttling for metric dimension and its variants
- Open Access
Extending a conjecture of Graham and Lovász on the distance characteristic polynomial
Graham and Lov\'{a}sz conjectured in 1978 that the sequence of normalized coefficients of the distance characteristic polynomial of a tree of order $n$ is unimodal with the maximum value occurring at $\lfloor\frac{n}{2}\rfloor$. In this paper we investigate this problem for block graphs. In particular, we prove the unimodality part and we establish the peak for several extremal cases of uniform block graphs with small diameter.Open AccessExtending a conjecture of Graham and Lovász on the distance characteristic polynomial
Graham and Lov\'{a}sz conjectured in 1978 that the sequence of normalized coefficients of the distance characteristic polynomial of a tree of order $n$ is unimodal with the maximum value occurring at $\lfloor\frac{n}{2}\rfloor$. In this paper we investigate this problem for block graphs. In particular, we prove the unimodality part and we establish the peak for several extremal cases of uniform block graphs with small diameter. - 5 May 2022
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- p. 280-294
Constructions of cospectral graphs with different zero forcing numbers
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper, we show that several NP-hard zero forcing numbers are not characterized by the spectra of several types of associated matrices with a graph. In particular, we consider standard zero forcing, positive semidefinite zero forcing, and skew zero forcing and provide constructions of infinite families of pairs of cospectral graphs, which have different values for these numbers. We explore several methods for obtaining these cospectral graphs including using graph products, graph joins, and graph switching. Among these, we provide a construction involving regular adjacency cospectral graphs; the regularity of this construction also implies cospectrality with respect to several other matrices including the Laplacian, signless Laplacian, and normalized Laplacian. We also provide a construction where pairs of cospectral graphs can have an arbitrarily large difference between their zero forcing numbers.
- 5 May 2022
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- p. 280-294
Constructions of cospectral graphs with different zero forcing numbers
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper, we show that several NP-hard zero forcing numbers are not characterized by the spectra of several types of associated matrices with a graph. In particular, we consider standard zero forcing, positive semidefinite zero forcing, and skew zero forcing and provide constructions of infinite families of pairs of cospectral graphs, which have different values for these numbers. We explore several methods for obtaining these cospectral graphs including using graph products, graph joins, and graph switching. Among these, we provide a construction involving regular adjacency cospectral graphs; the regularity of this construction also implies cospectrality with respect to several other matrices including the Laplacian, signless Laplacian, and normalized Laplacian. We also provide a construction where pairs of cospectral graphs can have an arbitrarily large difference between their zero forcing numbers.