Computing the edge metric dimension of convex polytopes related graphs


Authors

Muhammad Ahsan - Department of Mathematics, University of Management and Technology, Lahore 54770, Pakistan. Zohaib Zahid - Department of Mathematics, University of Management and Technology, Lahore 54770, Pakistan. Sohail Zafar - Department of Mathematics, University of Management and Technology, Lahore 54770, Pakistan. Arif Rafiq - Department of Mathematics, Virtual University of Pakistan (VU), Lahore, Pakistan. Muhammad Sarwar Sindhu - Department of Mathematics, Virtual University of Pakistan (VU), Lahore, Pakistan. Muhammad Umar - Department of Mathematics, Virtual University of Pakistan (VU), Lahore, Pakistan.


Abstract

Let \(G=(V(G),E(G))\) be a connected graph and \(d(f,y)\) denotes the distance between edge \(f\) and vertex \(y\), which is defined as \(d(f,y) = \min \{d(p,y),d(q,y)\}\), where \(f=pq\). A subset \(W_E \subseteq V(G)\) is called an edge metric generator for graph \(G\) if for every two distinct edges \(f_1, f_2 \in E(G)\), there exists a vertex \(y\in W_E\) such that \(d(f_1,y) \neq d(f_2,y)\). An edge metric generator with minimum number of vertices is called an edge metric basis for graph \(G\) and the cardinality of an edge metric basis is called the edge metric dimension represented by \(edim(G)\). In this paper, we study the edge metric dimension of flower graph \({f}_{n\times 3}\) and also calculate the edge metric dimension of the prism related graphs \(D_{n}^{'}\) and \(D_{n}^{t}\). It has been concluded that the edge metric dimension of \(D_{n}^{'}\) is bounded, while of \({f}_{n\times 3}\) and \(D_{n}^{t}\) is unbounded.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

Muhammad Ahsan, Zohaib Zahid, Sohail Zafar, Arif Rafiq, Muhammad Sarwar Sindhu, Muhammad Umar, Computing the edge metric dimension of convex polytopes related graphs, Journal of Mathematics and Computer Science, 22 (2021), no. 2, 174--188

AMA Style

Ahsan Muhammad, Zahid Zohaib, Zafar Sohail, Rafiq Arif, Sindhu Muhammad Sarwar, Umar Muhammad, Computing the edge metric dimension of convex polytopes related graphs. J Math Comput SCI-JM. (2021); 22(2):174--188

Chicago/Turabian Style

Ahsan, Muhammad, Zahid, Zohaib, Zafar, Sohail, Rafiq, Arif, Sindhu, Muhammad Sarwar, Umar, Muhammad. "Computing the edge metric dimension of convex polytopes related graphs." Journal of Mathematics and Computer Science, 22, no. 2 (2021): 174--188


Keywords


MSC


References