19 citations · 36 across the 21 of their papers we have counts for
17 papers · 1 filter
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning +1
A set of vertices in a graph is a dominating set of if every vertex not in has a neighbor in , where two vertices are neighbors if they are adjacent. The dominat…
On the Vertices That Belong to All Minimum Identifying Codes
Ville Junnila, Tero Laihonen, Havu Miikonen
Identifying codes in graphs have been widely studied since their introduction by Karpovsky, Chakrabarty and Levitin in 1998. In this paper, we consider the vertices that are in eve…
On the Maximum Number of Vertices that Belong to Every Metric Basis
Anni Hakanen, Ville Junnila, Tero Laihonen +2
Metric bases of graphs have been widely studied since their introduction in the 1970's by Slater and, independently, by Harary and Melter. In this paper, we concentrate on the exis…
The Size of the Intersection of -ary Hamming Balls
Ville Junnila, Tero Laihonen, Tuomo Lehtilä +1
The interest in studying the size of the intersection of multiple -ary Hamming balls has grown due to the recent advances in DNA-based data storage systems. We present an exact…
New Results on Vertices that Belong to Every Minimum Locating-Dominating Code
Ville Junnila, Tero Laihonen, Havu Miikonen
Locating-dominating codes have been studied widely since their introduction in the 1980s by Slater and Rall. In this paper, we concentrate on vertices that must belong to all minim…
On the unicyclic graphs having vertices that belong to all their (strong) metric bases
Anni Hakanen, Ville Junnila, Tero Laihonen +1
A metric basis in a graph is a smallest possible set of vertices of , with the property that any two vertices of are uniquely recognized by using a vector of distanc…