Explore BrainMass

Trees and Incidence Matrices

Let G be a graph with p vertices and p-1 edges.
Prove that G is a tree iff any p-1 rows of the incidence matrix are linearly independent over Z/(2) (integers modulo 2).

Solution Summary

Trees and Incidence Matrices are investigated. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.