Abstract
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 ℓ vertices) instead of just one vertex with the aid of the array of distances. The smallest cardinality of a set S resolving at most ℓ vertices is called ℓ-set-metric dimension. We study the problem of the ℓ-set-metric dimension in two infinite classes of graphs, namely, the two dimensional grid graphs and the n-dimensional binary hypercubes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
