INDEPENDENT METRIC DIMENSION OF COCONUT TREE AND EXTENDED JEWEL GRAPH

A finite vector that represents the distances between a vertex and the vertices of an ordered subset is the metric representation of a vertex of a graph. is called a minimal resolving set if no suitable subset of provides distinct representations for every vertex of . The lowest minimal resolving set (in relation to its cardinality) has a cardinality that determines 's metric dimension. In case has independent vertices, it can be referred to as an independent resolving set (ir-set). The value of the independent resolving number for different classes of graphs is found and defined. In this study, we investigate the graph classes' independent metric dimension. Our results demonstrate the differences in independent metric dimensions throughout families of graphs.