Draw the three nonisomorphic trees with five vertices and say how many distinct labelings each of the three trees has. Please explain your answer

2. Describe each graph below. Explain how many vertices and how many edges it has, and if it is a tree or not a tree. Graphs A LA Write your response below:

G is a forest with 100 vertices and 87 edges. How many additional edges should be added to make G a tree?

Please see attac

1. What is the largest n such that P₁, is a subgraph of K? 2. What is the largest n such that C₁ is a subgraph of K? 3. What is the largest n such that P₁ is an induced subgraph of K₁² 4. What is the largest n such that C₁ is an induced subgraph of K6?

Construct a connected bipartite graph that is not a tree with vertices A, B, C, D, E, F. What is the edge set? Construct a bipartite graph with vertices A, B, C, D, E, F such that the degree of D is 4. What is the edge set?