Computation of edge metric dimension of barycentric subdivision of Cayley graphs

Authors

  • Zeshan Saleem Mufti COMSATS University Islamabad Lahore Campus - Department of Mathematics
  • Muhammad Faisal Nadeem COMSATS University Islamabad Lahore Campus - Department of Mathematics
  • Ali Ahmad Information Systems Jazan University - College of Computer Science
  • Zaheer Ahmad Khwaja Fareed University of Engineering and Information Technology

Keywords:

metric dimension, edge metric dimension, resolving set, barycentric subdivision, Cayley graph

Abstract

Let G = (V,E) be a connected graph, let x ∈ V(G) be a vertex and e = yz ∈ E(G) be an edge.  The distance between the vertex x and the edge e is given by dG(x,e) = min{dG(x,y), dG(x,z)}.  A vertex t ∈ V(G) distinguishes two edges e, f ∈ E(G) if dG(t,e) ≠ dG(t,f).  A set R ⊆ V(G) is an edge metric generator for G if every two edges of G are distinguished by some vertex of R.  The minimum cardinality of R is called the edge metric dimension and is denoted by edim(G).  In this paper, we compute the edge metric dimension of barycentric subdivision of Cayley graphs Cay(\(\mathbb{Z}\)n ⊕ \(\mathbb{Z}\)2).

Downloads

Published

2020-07-31

How to Cite

Mufti, Z. S., Nadeem, M. F., Ahmad, A., & Ahmad, Z. (2020). Computation of edge metric dimension of barycentric subdivision of Cayley graphs. Italian Journal of Pure and Applied Mathematics, 44, 714–722. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/7433

Issue

Section

Articoli - Forum Editrice

Similar Articles

<< < 14 15 16 17 18 19 20 21 22 23 > >> 

You may also start an advanced similarity search for this article.