Independent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes
Chris Monica, D. Little · International Journal of Computer Applications · 2017
A subset S of vertices in a graph G is said to be an independent set of G if each edge in the graph has at most one endpoint in S and a set W V is said to be a resolving set of G, if the vertices in G have distinct representations with respect to W. A resolving set W is said to be an independent resolving set, or an ir-set, if it is both resolving and independent.The minimum cardinality of W is called the independent resolving number and is denoted by ir(G).In this paper, we determine the independent resolving number of Fibonacci Cubes and Extended Fibonacci cubes.