search
Log In
1 vote
257 views

in Graph Theory 257 views
0
is it even????
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
0
@Gurdeep show me any case in which u r getting odd no of vertices
0

degree in case of tree is no of child

0
@saini understood thank u
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
if it would have been graph then the answer would be even . right?
0
yes @manas mishra
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
0
it's b) right ???
0
No answer is c     @magma
0

Manas Mishra

can you give me one example where number of vertex  = odd ??

0
@magma see Gurdeep Saini comment , she has given example of both odd and even degree
0

Ooh sorry my bad ...

thanks  Manas Mishra

0
According to me the answer should be even considering the degree of a node as the number of adjacent vertices to it.
0
Answer should be B), there is no way, odd number of vertices possible.

Please log in or register to answer this question.

Related questions

1 vote
1 answer
1
240 views
Consider a graph $G$ with $2^{n}$ vertices where the level of each vertex is a $n$ bit binary string represented as $a_{0},a_{1},a_{2},.............,a_{n-1}$, where each $a_{i}$ is $0$ or $1$ ... $x$ and $y$ denote the degree of a vertex $G$ and number of connected component of $G$ for $n=8.$ The value of $x+10y$ is_____________
asked May 23, 2019 in Graph Theory srestha 240 views
1 vote
2 answers
2
286 views
What is the probability that there is an edge in an undirected random graph having 8 vertices? 1 1/8
asked May 19, 2019 in Graph Theory Hirak 286 views
1 vote
1 answer
3
93 views
If G be connected planar graph with 12 vertices of deg 4 each. In how many regions can this planar graph be partitioned?
asked Mar 28, 2019 in Graph Theory srestha 93 views
1 vote
1 answer
4
97 views asked Jan 24, 2019 in Graph Theory Shankar Kakde 97 views
...