Share
Explore BrainMass

Undergrad Topology - 400 Level

1. Prove that v(Г) - e(Г) = 1 for any tree T. (v :vertices and e : edges)
2. Even better, show that v(Г) - e(Г) ≤ 1 for any graph Г, with equality precisely when Г is a tree.

Attachments

$2.19