(adsbygoogle = window.adsbygoogle || []).push({}); Graph problem!!!

Proove that:

If we have a matrix

|e11 e12 ... e1n|

|e21 e22 ... e2n|

| ..................... |

|en1 en2 ... enn|

(eij edges of a graph G)

where every row is a spanning tree of G

then

there is a recomposition of every row so that the columns are also spanning trees of G.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Graph problem

**Physics Forums | Science Articles, Homework Help, Discussion**