Solution to Q.No.5. [2+1+3] a) Draw a tree with n vertices with n+1 vertices of degree 2, … - Sikademy
Author Image

Archangel Macsika

Q.No.5. [2+1+3] a) Draw a tree with n vertices with n+1 vertices of degree 2, n+2 vertices of degree 3, and n+3 vertices of degree 1. Where n is even digit of your arid number e.g 19-arid-234 take n=2

The Answer to the Question
is below this banner.

Can't find a solution anywhere?

NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?

Get the Answers Now!

You will get a detailed answer to your question or assignment in the shortest time possible.

Here's the Solution to this Question

The number of vertices of odd degree in a graph is always even (Reinhard Diestel,

"Graph Theory", p.5).

For n+2 vertices of degree 3, and n+3 vertices of degree 1:


n+2+n+3=2n+5 - the \space result \space is \space always \space odd



Answer: impossible to draw required tree

Related Answers

Was this answer helpful?

Join our Community to stay in the know

Get updates for similar and other helpful Answers

Question ID: mtid-5-stid-8-sqid-2794-qpid-1351