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

15. Full binary tree, nine vertices, five internal vertices

Draw a graph with the given specifications or explain the reason if no such graph exists.

Given information:

Full binary tree, nine vertices, live internal vertices.

Concept used:

The maximum level of any vertex of a rooted tree is known as the height of the tree and node of the tree is caled vertices.

Calculation:

There is no full binary tree with 9 vertices and 5 internal vertices because any full binary tree has 2k+1 vertices, where k is the number of internal vertices