| Abstrakt: |
Let G = (V, E) be a connected, basic, and finite graph. A subset T = u 1 , u 2 , ... , u k of V(G) is said to be a resolving set if for any y ∈ V(G), the code of y with regards to T, represented by C T y , which is defined as C T y = d u 1 , y , d u 2 , y , ... , d u k , y , is different for various y. The dimension of G is the smallest cardinality of a resolving set and is denoted by dim(G). If, for any t ∈ V – S, there exists r ∈ S such that S – r ∪ t is a resolving set, then the resolving set S is secure. The secure metric dimension of is the cardinal number of the minimum secure resolving set. Determining the secure metric dimension of any given graph is an NP-complete problem. In addition, there are several uses for the metric dimension in a variety of fields, including image processing, pattern recognition, network discovery and verification, geographic routing protocols, and combinatorial optimization. In this paper, we determine the secure metric dimension of special graphs such as a globe graph G l n , flag graph F l n , H- graph of path P n , a bistar graph B n , n 2 , and tadpole graph T 3 , m . Finally, we derive the explicit formulas for the secure metric dimension of tadpole graph T n , m , subdivision of tadpole graph S T 3 , m , and subdivision of tadpole graph S T n , m . [ABSTRACT FROM AUTHOR] |
Plný text