Computation of edge metric dimension of barycentric subdivision of Cayley graphs
Keywords:
metric dimension, edge metric dimension, resolving set, barycentric subdivision, Cayley graphAbstract
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
How to Cite
Issue
Section
License
Copyright (c) 2020 Zeshan Saleem Mufti, Muhammad Faisal Nadeem, Ali Ahmad, Zaheer Ahmad

This work is licensed under a Creative Commons Attribution 4.0 International License.
L'opera è pubblicata sotto Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)

