On the metric dimension for random graphs 


The metric dimension of a graph G is the minimum number of vertices in a
subset S of the vertex set of G such that all other vertices are
uniquely determined by their distances to the vertices in S. In this
paper we investigate the metric dimension of the random graph G(n,p) for
a wide range of probabilities p=p(n).
Date: May 23, 2014 at 16:15 h
Date of closure: May 23, 2014
Venue: Bauchef 851 (entrada edificio nuevo)
Speaker: Dieter Mitsche
Affiliation: U. de Nice Sophia-Antipolis
Coordinator: Marcos Kiwi
Abstract:
PDF - PS

Posted on May 22, 2014 in Discrete Mathematics, Seminars