Abstract
Resolving sets are designed to locate an object in a network by measuring the distances to the object. However, if there are more than one object present in the network, this can lead to wrong conclusions. To overcome this problem, we introduce the concept of solid-resolving sets. In this paper, we study the structure and constructions of solid-resolving sets. In particular, we classify the forced vertices with respect to a solid-resolving set. We also give bounds on the solid-metric dimension utilizing concepts like the Dilworth number, the boundary of a graph, and locating-dominating sets. It is also shown that deciding whether there exists a solid-resolving set with a certain number of elements is an NP-complete problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
Disclaimer: 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.