3 papers
math.CO2024
The -bound for locating-dominating sets in subcubic graphs
Dipayan Chakraborty, Anni Hakanen, Tuomo Lehtilä
The location-domination number is conjectured to be at most half of the order for twin-free graphs with no isolated vertices. We prove that this conjecture holds and is tight for s…
math.CO2024
Partition strategies for the Maker-Breaker domination game
Guillaume Bagan, Eric Duchêne, Valentin Gledel +2
The Maker-Breaker domination game is a positional game played on a graph by two players called Dominator and Staller. The players alternately select a vertex of the graph that has…
cs.IT2024
On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
In the Levenshtein's sequence reconstruction problem a codeword is transmitted through channels and in each channel a set of errors is introduced to the transmitted word. In pr…