Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Landgren, Lorents F."'
Given a multigraph $G$, the all-terminal reliability $R(G,p)$ is the probability that $G$ remains connected under percolation with parameter $p$. Fixing the number of vertices $n$ and edges $m$, we investigate which graphs maximize $R(G,p)$ -- such g
Externí odkaz:
http://arxiv.org/abs/2407.20217
