Boris Brimkov

Available identifiers

zbMath Open brimkov.borisMaRDI QIDQ266792

List of research outcomes

Publication	Date of Publication	Type
Tangle bases: Revisited	2023-12-11	Paper
Graphs with degree sequence $\{m^{m-1},n^{n-1}\}$ and $\{m^n,n^m\}$	2023-08-12	Paper
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph	2023-01-11	Paper
Intersections and circuits in sets of line segments	2022-10-18	Paper
Computer assisted discovery: Zero forcing vs vertex cover	2022-09-09	Paper
Optimal conditions for connectedness of discretized sets	2022-07-18	Paper
Improved Computational Approaches and Heuristics for Zero Forcing	2022-06-28	Paper
Extending a conjecture of Graham and Lov\'{a}sz on the distance characteristic polynomial	2022-06-15	Paper
Constructions of cospectral graphs with different zero forcing numbers	2022-05-23	Paper
On Sets of Line Segments Featuring a Cactus Structure	2022-05-18	Paper
Minimal Zero Forcing Sets	2022-04-04	Paper
Optimizing the trade-off between number of cops and capture time in cops and robbers	2022-02-03	Paper
On connectedness of discretized sets	2021-07-01	Paper
On the status sequences of trees	2021-01-19	Paper
Graphs that are cospectral for the distance Laplacian	2020-07-22	Paper
The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination	2020-01-08	Paper
An exact algorithm for the minimum rank of a graph	2019-11-30	Paper
Power domination throttling	2019-10-18	Paper
Restricted power domination and zero forcing problems	2019-06-25	Paper
Connected power domination in graphs	2019-06-25	Paper
Computational approaches for zero forcing and related problems	2018-12-06	Paper
Spectral Bounds for the Connectivity of Regular Graphs with Given Order	2018-10-09	Paper
Intersections, circuits, and colorability of line segments	2018-08-21	Paper
Throttling for the game of cops and robbers on graphs	2018-07-26	Paper
Power domination polynomials of graphs	2018-05-28	Paper
On the Wiener index, distance cospectrality and transmission-regular graphs	2017-08-22	Paper
Injective choosability of subcubic planar graphs with girth 6	2017-08-01	Paper
Complexity and computation of connected zero forcing	2017-07-27	Paper
Memory efficient algorithms for cactus graphs and block graphs	2017-05-12	Paper
Graphs with Extremal Connected Forcing Numbers	2017-01-30	Paper
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs	2016-04-07	Paper
Characterizations of the Connected Forcing Number of a Graph	2016-04-04	Paper
A note on the clique number of complete $k$-partite graphs	2015-07-06	Paper
Geometric approach to string analysis: deviation from linearity and its use for biosequence classification	2013-08-13	Paper
Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD	2009-12-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Boris Brimkov