1. Consider the given graph. (a) Determine the number of vertices of the graph. (b) Determine whether the graph is connected.

Q1B. Consider the following graph: a C f e How many vertices are there in the graph? How many edges are there in the graph?

Construct a simple graph with vertices H, I, J, K whose degrees are 1, 1, 0, 0 What is the edge set?

1. Determine if the graph is a simple graph. If it is not a simple graph, explain why. a K1 y Write your response below:

Q14A. Consider the graph with the following vertices and edges: V = {a, b, c, d, e, f} E = {{a, b}, {a, c}, {a, d}, {a, f}, {b, c}, {b, f}, {c, d}, {c, f}, {d, e}, {d, f} Which of the following sets of edges represent subgraphs of the graph that are trees? (Select all that apply.)   Question 14 options:   {{a, b}, {a, c}, {a, d}, {a, f}, {d, e}, {d, f}}   {{a, b}, {a, c}, {a, d}, {a, f}, {d, e}}   {{a, d}, {b, c}, {c, d}, {d, e}, {d, f}}   {{a, b}, {a, c}, {a, d}, {a, f}}   {{a, c}, {a, d}, {d, e}, {d, f}}

a) Sketch the graph.

Use the graph below to answer the follow questions. A. Determine how many vertices the graph has.      B. Determine how many edges the graph has.         C. Determine the degree of each vertex. vertex A:        vertex B:        vertex C:        vertex D:        vertex E:        vertex F:        vertex G:        vertex H:       D.This graph is currently connected. What edges could be removed to make it disconnected?

How many edges will you have in a complete graph made of 40 vertices? Show all steps of your calculation.

6

Q1D. Consider the following graph: a с f d e How many vertices are there in the graph? How many edges are there in the graph? A