On the edge metric dimension of convex polytopes and its related graphs

Yuezhong Zhang and Suogang Gao ()
Additional contact information
Yuezhong Zhang: Hebei Normal University
Suogang Gao: Hebei Normal University

Journal of Combinatorial Optimization, 2020, vol. 39, issue 2, No 3, 334-350

Abstract: Abstract Let $$G=(V, E)$$G=(V,E) be a connected graph. The distance between the edge $$e=uv\in E$$e=uv∈E and the vertex $$x\in V$$x∈V is given by $$d(e, x) = \min \{d(u, x), d(v, x)\}$$d(e,x)=min{d(u,x),d(v,x)}. A subset $$S_{E}$$SE of vertices is called an edge metric generator for G if for every two distinct edges $$e_{1}, e_{2}\in E$$e1,e2∈E, there exists a vertex $$x\in S_{E}$$x∈SE such that $$d(e_{1}, x)\ne d(e_{2}, x)$$d(e1,x)≠d(e2,x). An edge metric generator containing a minimum number of vertices is called an edge metric basis for G and the cardinality of an edge metric basis is called the edge metric dimension denoted by $$\mu _{E}(G)$$μE(G). In this paper, we study the edge metric dimension of some classes of plane graphs. It is shown that the edge metric dimension of convex polytope antiprism $$A_{n}$$An, the web graph $${\mathbb {W}}_{n}$$Wn, and convex polytope $${\mathbb {D}}_{n}$$Dn are bounded, while the prism related graph $$D^{*}_{n}$$Dn∗ has unbounded edge metric dimension.

Keywords: Metric dimension; Edge metric dimension; Edge metric generator; Convex polytopes (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00472-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:39:y:2020:i:2:d:10.1007_s10878-019-00472-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00472-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().