2 citations · 6 across the 5 of their papers we have counts for
5 papers · 1 filter
Optimal conditions for connectedness of discretized sets
Boris Brimkov, Valentin E. Brimkov
Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set is obtained by taking the inte…
Graphs with Extremal Connected Forcing Numbers
Boris Brimkov, Caleb C. Fast, Illya V. Hicks
Zero forcing is an iterative graph coloring process where at each discrete time step, a colored vertex with a single uncolored neighbor forces that neighbor to become colored. The…
Complexity and Computation of Connected Zero Forcing
Boris Brimkov
Zero forcing is an iterative graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. It is NP-hard to find a minimum ze…
Characterizations of the Connected Forcing Number of a Graph
Boris Brimkov, Randy Davila
Zero forcing is a dynamic graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. This forcing process has been used to…
A note on the clique number of complete -partite graphs
Boris Brimkov
In this note, we show that a complete -partite graph is the only graph with clique number among all degree-equivalent simple graphs. This result gives a lower bound on the c…