<![CDATA[A total k-labeling is a function fe from the edge set to the set {1, 2, . . . , ke} and a function fv from the vertex set to the set {0, 2, 4, . . . , 2kv}, where k = max{ke, 2kv}. A distance irregular reflexive k-labeling of the graph G is the total k-labeling, if for every two different vertices u and u 0 of G, w(u) 6= w(u 0 ), where w(u) = Σui∈N(u)fv(ui) + Σuv∈E(G)fe(uv). The minimum k for graph G which has a distance irregular reflexive k-labelling is called distance reflexive strength of the graph G, denoted by Dref (G). In this paper, we determine the exact value of distance reflexive strength of some connected graphs, namely path, star, and friendship graph.]]>
Copyrights © 2023
