1 votes 1 votes If a tree has n1 nodes of degree 1,n2 nodes of degree 2 ,nm nodes of degree m,then number of terminal nodes it has?????? Smrutiprajna asked Aug 8, 2017 Smrutiprajna 392 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply joshi_nitish commented Aug 8, 2017 reply Follow Share it will have 2 terminal nodes.. 0 votes 0 votes Smrutiprajna commented Aug 8, 2017 reply Follow Share How??? 0 votes 0 votes joshi_nitish commented Aug 8, 2017 reply Follow Share n1 nodes of degree 1, n2 nodes of degree 2, n3 nodes of degree 3...........nm nodes of degree m in any simple graph, sum of degrees= 2*nos of edges nos of edges in above tree= number of nodes-1=(n1+n2+n3.......nm)-1 sum of degree=1*n1 + 2*n2 + 3*n3........m*nm, now 1*n1 + 2*n2 + 3*n3........m*nm= 2*((n1+n2+n3.......nm)-1) on simplifying, n1 - n3 - 2n4 - 3n5.......(2-m)nm = 2 there could be several solution, one of that is n1= 2, n3=n4=n5.....=nm=0 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Number of terminal nodes is n1 because terminal nodes which are leaf nodes always have a degree of 1 saurabh_dan answered Aug 8, 2017 saurabh_dan comment Share Follow See all 0 reply Please log in or register to add a comment.