2000 character limit reached
On the edge metric dimension for the random graph (1612.06936v1)
Published 21 Dec 2016 in math.CO
Abstract: Let $G(V, E)$ be a connected simple undirected graph. In this paper we prove that the edge metric dimension (introduced by Kelenc, Tratnik and Yero) of the Erd\H{o}s-R\'enyi random graph $G(n, p)$ is given by: $$\textrm{edim}(G(n, p)) = (1 + o(1))\frac{4\log(n)}{\log(1/q)},$$ where $q = 1 - 2p(1-p)2(2-p)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.