Ask your own question, for FREE!
Mathematics 24 Online
OpenStudy (dan815):

Graph Theory Prove that for a graph if 2 spanning trees exist, T1,T2 and if there is an edge e1 in T1 that is not in T2,there is always some other edge e2 in T2, that is not in T1, such that T2+e1-e2 is another spanning tree of the graph.

OpenStudy (dan815):

|dw:1447899076635:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!