In connected graphs the number of min-forced vertices is at most (2/3)(n minus the size of a minimum locating-dominating code), implying a maximum ratio of 2/5 attained by certain paths, and deciding whether a vertex is min-forced is co-NP-hard.
Unique (optimal) solutions: co mplexity results for identifying and locating- dominating codes, Theor
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
The paper surveys Iiro Honkala's contributions to identifying codes across complexity, combinatorics, grids, graph parameters, structural properties, and optimal code counts.
citing papers explorer
-
New Results on Vertices that Belong to Every Minimum Locating-Dominating Code
In connected graphs the number of min-forced vertices is at most (2/3)(n minus the size of a minimum locating-dominating code), implying a maximum ratio of 2/5 attained by certain paths, and deciding whether a vertex is min-forced is co-NP-hard.
-
On Iiro Honkala's contributions to identifying codes
The paper surveys Iiro Honkala's contributions to identifying codes across complexity, combinatorics, grids, graph parameters, structural properties, and optimal code counts.