다. H I Consider the graph given above. Add an edge so the resulting graph has an Euler path (without repeating an existing edge). HG Now give an Euler path through the graph with this new edge by listing the vertices in the order visited.

Read all directions before answering a question. This assignment is conceptual in nature so no work is needed BUT be sure to be clear and state all answers in complete sentences where needed. Write answers on this sheet. 1) Determine how many vertices and edges the graph has and the degree of each vertex. State the degree next to the vertex OR state the vertex label letter and the degree in the space to the right of the graph. A B E с D # of vertices = # of edges =

Kindly don't give handwritten answer and do both question as both are related

Construct a graph with vertices I, J, K, L, M, N that has an Euler path, the degree of K is 1 and the degree of N is 3. What is the edge set? ←

Suppose that a town has 7 bridges as pictured below. Create a graph and use it to determine if there is a path that crosses all bridges at once.

Discrete Math: