Edge metric dimension and mixed metric dimension of planar graph \(Q_n\) (Q2166263)

Throughout this article, \(G\) is a finite, simple, and connected graph with the vertex set \(V\) and the edge set \(E\). The distance between the vertex \(u\) and the edge \(e = vw\) is defined as \(d(u,e) = \min\{d(u,v), d(u,w)\}\). A vertex \(x\) distinguishes two edges \(e_1\), \(e_2\) if \(d(x,e_1)\not=d(x,e_2)\). A subset \(L_e\) of \(V\) is called an edge metric generator for \(G\) if every two distinct edges of \(G\) are distinguished by some vertex of \(L_e\). The minimum cardinality of an edge metric generator for \(G\) is called the edge metric dimension and is denoted by \(\dim_e(G)\). A vertex \(x\) distinguishes two elements (vertices or edges) \(u, v\in V \cup E\) if \(d(x, u)\not=d(x, v)\). A subset \(L_m\) of \(V\) is called a mixed metric generator for \(G\) if every two distinct elements (vertices and edges) of \(G\) are distinguished by some vertex of \(L_m\). The minimum cardinality of a mixed metric generator for \(G\) is called the mixed metric dimension and is denoted by \(\dim_m(G)\). This article is a study on the edge metric dimension and the mixed metric dimension of a planar graph \(Q_n\). The authors prove that the edge metric dimension and the mixed metric dimension of \(Q_n\) are both finite and do not depend upon the number of vertices.