The independent resolving number of a graph
Gary Chartrand, Varaporn Saenpholphat, Ping Zhang (2003)
Mathematica Bohemica
Similarity:
For an ordered set of vertices in a connected graph and a vertex of , the code of with respect to is the -vector The set is an independent resolving set for if (1) is independent in and (2) distinct vertices have distinct codes with respect to . The cardinality of a minimum independent resolving set in is the independent resolving number . We study the existence of independent resolving sets in graphs, characterize all nontrivial connected graphs of order...