Number of spanning tree in a grid graph

Asked Jan 12 '17 at 16:46

Active Jan 12 '17 at 16:57

Viewed 265 times

I'm having some issue trying to solve this problem: How many different spanning trees does the (grid graph) M 2,4 have?

Can someone explain me how to find this number?

(I didn't see Kirchhoff theorem or Matrix tree in class so I shouldn't use them)

Thanks

edited Jan 12 '17 at 16:57

Codor

asked Jan 12 '17 at 16:46

nvmb3r

Possibly related: [Caley's formula](https://en.wikipedia.org/wiki/Cayley%27s_formula) – Codor Jan 12 '17 at 16:59
Caley's formula works just for complete connected graphs – nvmb3r Jan 12 '17 at 17:03

0 Answers0