A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
The metric dimension for resolving several objects
Tekijät: Laihonen T
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 2016
Journal: Information Processing Letters
Tietokannassa oleva lehden nimi: INFORMATION PROCESSING LETTERS
Lehden akronyymi: INFORM PROCESS LETT
Vuosikerta: 116
Numero: 11
Aloitussivu: 694
Lopetussivu: 700
Sivujen määrä: 7
ISSN: 0020-0190
eISSN: 1872-6119
DOI: https://doi.org/10.1016/j.ipl.2016.06.002
Tiivistelmä
A set of vertices S is a resolving set in a graph if each vertex has a unique array of distances to the vertices of S. The natural problem of finding the smallest cardinality of a resolving set in a graph has been widely studied over the years. In this paper, we wish to resolve a set of vertices (up to l vertices) instead of just one vertex with the aid of the array of distances. The smallest cardinality of a set S resolving at most l vertices is called l-set-metric dimension. We study the problem of the l-set-metric dimension in two infinite classes of graphs, namely, the two dimensional grid graphs and the n-dimensional binary hypercubes. (C) 2016 Elsevier B.V. All rights reserved.
A set of vertices S is a resolving set in a graph if each vertex has a unique array of distances to the vertices of S. The natural problem of finding the smallest cardinality of a resolving set in a graph has been widely studied over the years. In this paper, we wish to resolve a set of vertices (up to l vertices) instead of just one vertex with the aid of the array of distances. The smallest cardinality of a set S resolving at most l vertices is called l-set-metric dimension. We study the problem of the l-set-metric dimension in two infinite classes of graphs, namely, the two dimensional grid graphs and the n-dimensional binary hypercubes. (C) 2016 Elsevier B.V. All rights reserved.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
Turun yliopiston Tutkimustietojärjestelmän portaali