is it even????

1 vote

1

i think it will be even becoz Non pendant vertex is that vertex which are not leaves (i.e whose degree is not one) so as it is mentioned that every non pendant vertex degree is 3 so every non leaf node will be connected with 3 vertex and one vertex itself , so total vertex will always be even

0

degree of vertex in tree is the number of child not the number of adjacent edge

so answer is odd or even i.e. option C

so answer is odd or even i.e. option C

1

@manas

degree in case of tree and degree in case of graph both are different

if it is graph that your statement is right but

degree in case of tree is the no of child of that vertex

degree in case of graph is the no of adjacent edge to that node

0

Gurdeep Saini every tree is a graph. so how can you say that degree in case of the tree is different and degree in case of graph is different?

1

@utkarsh for example - we say that in case of binary tree all nodes should have dgree 0 or 1 or 2 , means it should have 0 or 1 or 2 children so in case of tree degree is the no of children it have

0

@utkarsh

did you hear about a binary tree and some of its node have degree 3 ?

i think no

so now you can understand

did you hear about a binary tree and some of its node have degree 3 ?

i think no

so now you can understand