Find all nonisomorphic trees with five vertices.

To find:

All the nonisomorphic trees having five vertices.

Given information:

Non isomorphic trees with five vertices.

Concept used:

Any tree with n vertices has n−1 edges and total degree is 2(n−1).

Calculation:

Any tree with n vertices has n−1 edges, where n is a positive integer.

Here, the tree having five vertices, this implies that tree will have a total of four edges