On mixed metric dimension in subdivision, middle, and total graphs

Abstract

Let G be a graph and let S(G), M(G), and T(G) be the subdivision, the middle, and the total graph of G, respectively. Let dim(G), edim(G), and mdim(G) be the metric dimension, the edge metric dimension, and the mixed metric dimension of G, respectively. In this paper, for the subdivision graph it is proved that max{dim(G), edim(G)} ≤ mdim(S(G)) ≤ mdim(G). A family of graphs Gn is constructed for which mdim(Gn ) − mdim(S(Gn )) ≥ 2 holds and this shows that the inequality mdim(S(G)) ≤ mdim(G) can be strict, while for a cactus graph G, mdim(S(G)) = mdim(G). For the middle graph it is proved that dim(M(G)) ≤ mdim(G) holds, and if G is tree with n 1(G) leaves, then dim(M(G)) = mdim(G) = n 1(G). Moreover, for the total graph it is proved that mdim(T(G)) = 2n 1(G) and dim(G) ≤ dim(T (G)) ≤ n 1(G) hold when G is a tree.