Boris Brimkov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Boris Brimkov has a total of 42 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 - Jane Breen
Department of Mathematics, Iowa State University, Ames, Ia., U.S.A.
2 shared publications - Jesse Geneson
Department of Mathematics Iowa State University 50011 Ames IA USA
2 shared publications - K. E. Perry
Soka Univ Amer, Aliso Viejo, CA USA
2 shared publications - Leslie Hogben
Department of Mathematics, Iowa State University, Ames, USA
2 shared publications - Thomas R. Cameron
Department of Mathematics Penn State Behrend
2 shared publications
Latest Publications
- Open Access
Throttling for metric dimension and its variants
Metric dimension is a graph parameter that has been applied to robot navigation and finding low-dimensional vector embeddings. Throttling entails minimizing the sum of two available resources when solving certain graph problems. In this paper, we introduce throttling for metric dimension, edge metric dimension, and mixed metric dimension. In the context of vector embeddings, metric dimension throttling finds a low-dimensional, low-magnitude embedding with integer coordinates. We show that computing the throttling number is NP-hard for all three variants. We give formulas for the throttling numbers of special families of graphs, and characterize graphs with extremal throttling numbers. We also prove that the minimum possible throttling number of a graph of order $n$ is $Θ\left(\frac{\log{n}}{\log{\log{n}}}\right)$, while the minimum possible throttling number of a tree of order $n$ is $Θ(n^{1/3})$ or $Θ(n^{1/2})$ depending on the variant of metric dimension.Open AccessThrottling for metric dimension and its variants
Metric dimension is a graph parameter that has been applied to robot navigation and finding low-dimensional vector embeddings. Throttling entails minimizing the sum of two available resources when solving certain graph problems. In this paper, we introduce throttling for metric dimension, edge metric dimension, and mixed metric dimension. In the context of vector embeddings, metric dimension throttling finds a low-dimensional, low-magnitude embedding with integer coordinates. We show that computing the throttling number is NP-hard for all three variants. We give formulas for the throttling numbers of special families of graphs, and characterize graphs with extremal throttling numbers. We also prove that the minimum possible throttling number of a graph of order $n$ is $Θ\left(\frac{\log{n}}{\log{\log{n}}}\right)$, while the minimum possible throttling number of a tree of order $n$ is $Θ(n^{1/3})$ or $Θ(n^{1/2})$ depending on the variant of metric dimension. - Open Access
In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator
We present four open conjectures in graph theory generated by the automated conjecturing system \texttt{TxGraffiti}. Each conjecture is concise, grounded in natural graph invariants, and empirically validated across hundreds of graphs. Despite extensive effort, these statements remain unresolved--defying both proof and counterexample. They are not only mathematical challenges but creative expressions--born of symbolic pattern recognition and mathematician-defined heuristics, refined through years of human dialogue, and now offered back to the community as collaborative artifacts. These conjectures invite not only formal proof, but also reflection on how machines can evoke wonder, spark curiosity, and contribute to the raw material of discovery. By highlighting these problems, we aim to inspire both human mathematicians and AI systems to engage with them--not only to solve them, but to reflect on what it means when machines participate meaningfully in the creative process of mathematical thought.
Open AccessIn Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator
We present four open conjectures in graph theory generated by the automated conjecturing system \texttt{TxGraffiti}. Each conjecture is concise, grounded in natural graph invariants, and empirically validated across hundreds of graphs. Despite extensive effort, these statements remain unresolved--defying both proof and counterexample. They are not only mathematical challenges but creative expressions--born of symbolic pattern recognition and mathematician-defined heuristics, refined through years of human dialogue, and now offered back to the community as collaborative artifacts. These conjectures invite not only formal proof, but also reflection on how machines can evoke wonder, spark curiosity, and contribute to the raw material of discovery. By highlighting these problems, we aim to inspire both human mathematicians and AI systems to engage with them--not only to solve them, but to reflect on what it means when machines participate meaningfully in the creative process of mathematical thought.
- Open Access
Connected forcing density and related problems
A connected forcing set of a graph is a zero forcing set that induces a connected subgraph. In this paper, we introduce and study CF-dense graphs -- graphs in which every vertex belongs to some minimum connected forcing set. We identify several CF-dense graph families and investigate the relationships between CF-density and analogous notions in zero forcing and total forcing. We also characterize CF-dense trees and give a formula for the number of distinct connected forcing sets in trees. Finally, we analyze when CF-density is preserved under graph operations such as Cartesian products, joins, and coronas.
Open AccessConnected forcing density and related problems
A connected forcing set of a graph is a zero forcing set that induces a connected subgraph. In this paper, we introduce and study CF-dense graphs -- graphs in which every vertex belongs to some minimum connected forcing set. We identify several CF-dense graph families and investigate the relationships between CF-density and analogous notions in zero forcing and total forcing. We also characterize CF-dense trees and give a formula for the number of distinct connected forcing sets in trees. Finally, we analyze when CF-density is preserved under graph operations such as Cartesian products, joins, and coronas.
- Open Access
On the forts and related parameters of the hypercube graph
In 2018, forts were defined as non-empty subsets of vertices in a graph where no vertex outside the set has exactly one neighbor in the set. Forts have since been used to characterize zero forcing sets, model zero forcing as an integer program, and provide lower bounds on the zero forcing number. In this article, we give a complete characterization of minimum forts in the hypercube graph, showing that they are automorphic to one of two sets. In contrast, non-automorphic minimum zero forcing sets are identified with distinct propagation times. We also derive the fractional zero forcing number and bounds on the fort number of the hypercube. When the hypercube's dimension is a power of two, the fort number and fractional zero forcing number are equal to the domination number, total domination number, and open packing number. Lastly, we present general constructions for minimal forts in the Cartesian product of graphs, reflecting some minimal forts of the hypercube.
Open AccessOn the forts and related parameters of the hypercube graph
In 2018, forts were defined as non-empty subsets of vertices in a graph where no vertex outside the set has exactly one neighbor in the set. Forts have since been used to characterize zero forcing sets, model zero forcing as an integer program, and provide lower bounds on the zero forcing number. In this article, we give a complete characterization of minimum forts in the hypercube graph, showing that they are automorphic to one of two sets. In contrast, non-automorphic minimum zero forcing sets are identified with distinct propagation times. We also derive the fractional zero forcing number and bounds on the fort number of the hypercube. When the hypercube's dimension is a power of two, the fort number and fractional zero forcing number are equal to the domination number, total domination number, and open packing number. Lastly, we present general constructions for minimal forts in the Cartesian product of graphs, reflecting some minimal forts of the hypercube.
- Open Access
- 24 May 2023
- Published by IEOM Society International
Coloring Intersection Points of Line Segments
We study the minimum number of colors with which the intersection points of a set of line segments can be colored so that no segment contains points with the same color. We investigate the computational complexity of this problem and give exact results and bounds for different families of segments, including those corresponding to complete bipartite graphs, cactus graphs, and triangle-free graphs. We also relate the problem to the famous Erdős-Faber-Lovász Conjecture, and discuss computational experiments for certain randomly generated sets of segments.
- 24 May 2023
- Published by IEOM Society International
Open AccessColoring Intersection Points of Line Segments
We study the minimum number of colors with which the intersection points of a set of line segments can be colored so that no segment contains points with the same color. We investigate the computational complexity of this problem and give exact results and bounds for different families of segments, including those corresponding to complete bipartite graphs, cactus graphs, and triangle-free graphs. We also relate the problem to the famous Erdős-Faber-Lovász Conjecture, and discuss computational experiments for certain randomly generated sets of segments.
- 1 November 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 34 (6) , 2868-2872
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
The minimum rank of a graph G is the minimum of the ranks of all symmetric adjacency matrices of G. We present a new combinatorial bound for the minimum rank of an arbitrary graph G based on enumerating certain subsets of vertices of G satisfying matroid theoretic properties. We also present some computational and theoretical challenges associated with computing the minimum rank. This includes a conjecture that this bound on the minimum rank actually holds with equality for all graphs.
- 1 November 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 34 (6) , 2868-2872
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
The minimum rank of a graph G is the minimum of the ranks of all symmetric adjacency matrices of G. We present a new combinatorial bound for the minimum rank of an arbitrary graph G based on enumerating certain subsets of vertices of G satisfying matroid theoretic properties. We also present some computational and theoretical challenges associated with computing the minimum rank. This includes a conjecture that this bound on the minimum rank actually holds with equality for all graphs.
- 1 July 2022
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 43 (5) , 1493-1506
Optimal conditions for connectedness of discretized sets
- 1 July 2022
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 43 (5) , 1493-1506
Optimal conditions for connectedness of discretized sets
- Open Access
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.
Open AccessConstructions 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.
- Open Access
Minimal Zero Forcing Sets
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 forcing sets. We also study the maximum size of a minimal zero forcing set $\overline{\operatorname{Z}}(G)$, and relate it to the zero forcing number $\operatorname{Z}(G)$. Surprisingly, we show that the equality $\overline{\operatorname{Z}}(G)=\operatorname{Z}(G)$ is preserved by deleting a universal vertex, but not by adding a universal vertex. We also characterize graphs with extreme values of $\overline{\operatorname{Z}}(G)$ and explore the gap between $\overline{\operatorname{Z}}(G)$ and $\operatorname{Z}(G)$.Open AccessMinimal Zero Forcing Sets
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 forcing sets. We also study the maximum size of a minimal zero forcing set $\overline{\operatorname{Z}}(G)$, and relate it to the zero forcing number $\operatorname{Z}(G)$. Surprisingly, we show that the equality $\overline{\operatorname{Z}}(G)=\operatorname{Z}(G)$ is preserved by deleting a universal vertex, but not by adding a universal vertex. We also characterize graphs with extreme values of $\overline{\operatorname{Z}}(G)$ and explore the gap between $\overline{\operatorname{Z}}(G)$ and $\operatorname{Z}(G)$. - 1 January 2022
- Published by International Press of Boston in Journal of Combinatorics
- Vol. 13 (1) , 79-203
Optimizing the trade-off between number of cops and capture time in Cops and Robbers
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 1 January 2022
- Published by International Press of Boston in Journal of Combinatorics
- Vol. 13 (1) , 79-203
Optimizing the trade-off between number of cops and capture time in Cops and Robbers
International Press of Boston - publishers of scholarly mathematical and scientific journals and books