Showing cs.DMShow all
3 papers · 1 filter
cs.DM2026
Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth
Gaétan Berthe, Florent Foucaud, Tuomo Lehtilä +1
The neighbourhood complexity of a graph is a quantity measuring, for a graph and an integer , the maximum possible number (over all vertex subsets of size…
cs.DM2023
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…