In each of 8—21, either draw a graph with the given specifications or explain why no such graph exists.

12. Tree, five vertices, total degree 8

To draw:

A graph with the given specifications and also explain if no such type of graph exists.

Given information:

Tree. five vertices, total degree 8.

Concept used:

A tree with n vertices has n−1 edges.

Calculation:

Each and every edge has a degree two in a tree. For the total degree eight we need four edges.

Let the five vertices of the tree are a,b,c,d,e