Order reprints

On the edge metric dimension of graphs

Meiqin Wei Jun Yue Xiaoyu zhu

*Corresponding author: Jun Yue yuejun06@126.com


Let $G=(V,E)$ be a connected graph of order $n$. $S \subseteq V$ is an edge metric generator of $G$ if any pair of edges in $E$ can be distinguished by some element of $S$. The edge metric dimension $edim(G)$ of a graph $G$ is the least size of an edge metric generator of $G$. In this paper, we give the characterization of all connected bipartite graphs with $edim=n-2$, which partially answers an open problem of Zubrilina (2018). Furthermore, we also give a sufficient and necessary condition for $edim(G)=n-2$, where $G$ is a graph with maximum degree $n-1$. In addition, the relationship between the edge metric dimension and the clique number of a graph $G$ is investigated by construction.

Please supply your name and a valid email address you yourself

Fields marked*are required

Article URL   http://www.aimspress.com/Math/article/5112.html
Article ID   math-05-05-286
Editorial Email  
Your Name *
Your Email *
Quantity *

Copyright © AIMS Press All Rights Reserved