A certain tree has two vertices of degree $4$, one vertex of degree $3$ and one vertex of degree $2$. If the other vertices have degree $1$, how many vertices are there in the graph ?
in the given question is asking about no. of vertices in the tree as we know that
e(edge)=n(no. of vertice)-1
using the handshake theorem sum of degree = 2|e|
two vertices of degree 4, one vertex of 3 and one vertex of degree ‘2’. If all other vertices have degree 1
Feedback for next edition (if ever there's...