Answer:
8
Step-by-step explanation:
we know that
Euler's Sum of Degrees Theorem states that: The sum of the degrees of all the vertices equals twice the number of edges.
The number of edges in any tree with N vertices will be N - 1
so
The sum of degrees is given by
[tex]2(N-1)[/tex]
we have
[tex]N=5[/tex]
substitute
[tex]2(5-1)=8[/tex]
