Secure Resolving Sets in a Graph
Let G = (V, E) be a simple, finite, and connected graph. A subset S = {u1, u2, …, uk} of V(G) is called a resolving set (locating set) if for any x ∈ V(G), the code of x with respect to S that is denoted by CS (x), which is defined as CS (x) = (d(u1, x), d(u2, x), .., d(uk, x)),...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-09-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-8994/10/10/439 |