7 citations · 18 across the 14 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DM2023★ 1 cited
New Optimal Results on Codes for Location in Graphs
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
In this paper, we broaden the understanding of the recently introduced concepts of solid-locating-dominating and self-locating-dominating codes in various graphs. In particular, we…
cs.DM2023
Optimal local identifying and local locating-dominating codes
Pyry Herva, Tero Laihonen, Tuomo Lehtilä
We introduce two new classes of covering codes in graphs for every positive integer . These new codes are called local -identifying and local -locating-dominating codes an…
math.CO2023★ 7 cited
Neighbourhood complexity of graphs of bounded twin-width
Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä +1
We give essentially tight bounds for, , the maximum number of distinct neighbourhoods on a set of vertices in a graph with twin-width at most~. Using the celebra…