Affiliations: Department of Mathematics, University of Management and Technology, Lahore, Pakistan
Correspondence:
[*]
Corresponding author. Sohail Zafar, Department of Mathematics, University of Management and Technology, Lahore, Pakistan. E-mail: [email protected].
Abstract: Fault-tolerant resolving partition is natural extension of resolving partitions which have many applications in different areas of computer sciences for example sensor networking, intelligent systems, optimization and robot navigation. For a nontrivial connected graph G (V (G) , E (G)), the partition representation of vertex v with respect to an ordered partition Π = {Si : 1 ≤ i ≤ k} of V (G) is the k-vector
r(v|Π)=(d(v,Si))i=1k
, where, d (v, Si) = min {d (v, x) |x ∈ Si}, for i ∈ {1, 2, …, k}. A partition Π is said to be fault-tolerant partition resolving set of G if r (u|Π) and r (v|Π) differ by at least two places for all u ≠ v ∈ V (G). A fault-tolerant partition resolving set of minimum cardinality is called the fault-tolerant partition basis of G and its cardinality the fault-tolerant partition dimension of G denoted by
P(G)
. In this article, we will compute fault-tolerant partition dimension of families of tadpole and necklace graphs.
