Let G be a connected simple graph on n vertices. Show that we can obtain any spanning tree T1 from any other spanning tr
Posted: Wed Apr 27, 2022 3:32 pm
Let G be a connected simple graph on n vertices. Show that we
can obtain any spanning tree T1 from any other spanning tree T0 of
G via a finite sequence of the following moves: Given a tree T,
remove an edge from T and add another of G as long as it does not
create a cycle.
that's everything the question has
can obtain any spanning tree T1 from any other spanning tree T0 of
G via a finite sequence of the following moves: Given a tree T,
remove an edge from T and add another of G as long as it does not
create a cycle.
that's everything the question has