Share
Explore BrainMass

Trees, Vertices and Edges

Which one of these is correct and why?

If T is a tree with m vertices, how many edges does T have?
ans: m-1

or

If T is a tree with n vertices, how many edges does T have?
ans: n(n-1)/2

Solution Preview

If T is a tree with m vertices, T should have m-1 edges.

Proof:
Suppose the tree T has n levels, each level has a_k ...

Solution Summary

Trees, vertices and edges are investigated.

$2.19