83 citations · 346 across the 78 of their papers we have counts for
Showing 2012 · math.COShow all
3 papers · 2 filters
math.CO2012
On the Maximum Density of Graphs with Good Edge-Labellings
Abbas Mehrabian, Dieter Mitsche, Paweł Prałat
A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasin…
math.CO2012★ 3 cited
Metric dimension for random graphs
B. Bollobas, D. Mitsche, P. Pralat
The metric dimension of a graph is the minimum number of vertices in a subset of the vertex set of such that all other vertices are uniquely determined by their distanc…
math.CO2012
Revolutionaries and spies on random graphs
Dieter Mitsche, Pawel Pralat
Pursuit-evasion games, such as the game of Revolutionaries and Spies, are a simplified model for network security. In the game we consider in this paper, a team of revolutionar…