April 29th, 1999, 01:14 AM
I have question to which I am not able to find the answer. Can anyone help me out...if possible by sending the complete solution. The question is :
Show that if T is a spanning tree for an undirected graph G, then the addition of an edge e, e (epsilon crossed) E(T) and eeE(G), to T creates a unique cycle.
Show that if T is a spanning tree for an undirected graph G, then the addition of an edge e, e (epsilon crossed) E(T) and eeE(G), to T creates a unique cycle.