2 problems

Let $G$ be a $k$-vertex-connected graph, and let $r$ be any root of $G$. A collection of spanning trees $T_1,\dots,T_k$ is independent with root $r$ if, for every vertex…

Let $n$ and $f$ be positive integers, and let $k$ be an even integer. An $f$-EFT $(2k-1)$-spanner of a graph is an edge fault-tolerant spanner resilient to any set of at most $f$ f…