P. Tittmann

activity

20082022

most citedDomination Reliability

21 citations · 40 across the 11 of their papers we have counts for

collaborators

Showing 2010Show all

2 papers · 1 filter

math.CO2010

Random Information Spread in Networks

Raymond Lapus, Frank Simon, Peter Tittmann

Let G=(V,E) be an undirected loopless graph with possible parallel edges and s and t be two vertices of G. Assume that vertex s is labelled at the initial time step and that every…

math.CO2010

Counting Connected Set Partitions of Graphs

Frank Simon, Peter Tittmann, Martin Trinks

Let $G = (V, E)$ be a simple undirected graph with $n$ vertices then a set partition $π = {V_{1}, ..., V_{k}}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_…