You are not logged in.
Pages: 1
Please help me.
How many edges must be removed to produce the spanning forest of a graph
with n vertices, m edges and c connected components?
I am getting m+n+c but I am not confident in that answer
Prove that if T1, T2 and T3 are spanning trees of a simple connected graph G
then
d(T1,T3) <= d(T1,T2) + d(T2,T3)
I know the formula d=(T1,T2)= |E(T1)| + |E(T2)| - 2|E(T1) [intersect] E(T2)|
Last edited by uniquereason (2010-11-04 13:55:12)
Offline
Pages: 1