1 votes 1 votes Deepalitrapti asked Oct 24, 2018 Deepalitrapti 977 views answer comment Share Follow See all 19 Comments See all 19 19 Comments reply BASANT KUMAR commented Oct 24, 2018 reply Follow Share is it even???? 0 votes 0 votes Manas Mishra commented Oct 25, 2018 reply Follow Share 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 1 votes 1 votes Gurdeep Saini commented Oct 25, 2018 reply Follow Share 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 0 votes 0 votes Manas Mishra commented Oct 25, 2018 reply Follow Share @Gurdeep show me any case in which u r getting odd no of vertices 0 votes 0 votes Gurdeep Saini commented Oct 25, 2018 reply Follow Share degree in case of tree is no of child 0 votes 0 votes Manas Mishra commented Oct 25, 2018 i edited by Manas Mishra Oct 25, 2018 reply Follow Share @saini understood thank u 0 votes 0 votes Gurdeep Saini commented Oct 25, 2018 reply Follow Share @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 1 votes 1 votes Manas Mishra commented Oct 25, 2018 reply Follow Share if it would have been graph then the answer would be even . right? 0 votes 0 votes Gurdeep Saini commented Oct 25, 2018 reply Follow Share yes @manas mishra 0 votes 0 votes Utkarsh Joshi commented Oct 25, 2018 reply Follow Share 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? 0 votes 0 votes Manas Mishra commented Oct 25, 2018 reply Follow Share @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 1 votes 1 votes Gurdeep Saini commented Oct 25, 2018 reply Follow Share @utkarsh did you hear about a binary tree and some of its node have degree 3 ? i think no so now you can understand 0 votes 0 votes Magma commented Oct 25, 2018 reply Follow Share it's b) right ??? 0 votes 0 votes Manas Mishra commented Oct 25, 2018 reply Follow Share No answer is c @magma 0 votes 0 votes Magma commented Oct 25, 2018 reply Follow Share Manas Mishra can you give me one example where number of vertex = odd ?? 0 votes 0 votes Manas Mishra commented Oct 25, 2018 reply Follow Share @magma see Gurdeep Saini comment , she has given example of both odd and even degree 0 votes 0 votes Magma commented Oct 25, 2018 reply Follow Share Ooh sorry my bad ... thanks Manas Mishra 0 votes 0 votes Utkarsh Joshi commented Oct 25, 2018 reply Follow Share According to me the answer should be even considering the degree of a node as the number of adjacent vertices to it. 0 votes 0 votes daksirp commented Oct 25, 2018 reply Follow Share Answer should be B), there is no way, odd number of vertices possible. 0 votes 0 votes Please log in or register to add a comment.