94.8k views
4 votes
Determine whether the graph has a Euler Path or Circuit?

Question 1 options:

Euler Path

Euler Circuit


Neither


Not Traceable

Question 2 (1 point)

To create a Euler Path, we can start at

Question 2 options:

Vertex A and end at Vertex E

Vertex D and end at Vertex B

Vertex C and end at Vertex C

Vertex B and end at Vertex B
Question 3 (1 point)

To find the Minimal Spanning Tree using Kruskal’s Algorithm, we can start with what edge?
Question 3 options:

AC


AE


CD


AD

Question 4 (1 point)

A railroad system connecting five cities is being planned. The goal is to build this system using the least amount of money, while ensuring each city can be reached by any other city in the system. The graph below gives estimates for the cost, in hundreds of thousands of dollars, to build a railroad between any two cities. What rail system leads to the lowest construction cost? Use Kruskal’s Algorithm.

Question 4 options:

A


A or C


A or B


B or C

Question 5 (1 point)

Use the flow chart to find z when x = 9
Question 5 options:

170


180


200


29

Determine whether the graph has a Euler Path or Circuit? Question 1 options: Euler-example-1
Determine whether the graph has a Euler Path or Circuit? Question 1 options: Euler-example-1
Determine whether the graph has a Euler Path or Circuit? Question 1 options: Euler-example-2
Determine whether the graph has a Euler Path or Circuit? Question 1 options: Euler-example-3
Determine whether the graph has a Euler Path or Circuit? Question 1 options: Euler-example-4
Determine whether the graph has a Euler Path or Circuit? Question 1 options: Euler-example-5
User Xiechao
by
6.1k points

2 Answers

5 votes

#1 is Euler Circuit

#2 is Vertex D and end at Vertex B

#3 is AE

#4 i got wrong i put B to C (wrong)

#5 is 200

#6 is 25 days

#7 is Start c-d-e-finish

#8 I got wrong I put 2...(wrong)

#9 I got wrong I put 3 (wrong)

#10 is Red (AD) Green (CF) Blue (BE)


I made a 70...because again #4,8,9 is wrong!

Hope this helps!

User Apurv Agarwal
by
5.8k points
2 votes

Answer:

ques 1) Euler circuit

ques 2) start at vertex D and ends at B.

ques 3) AE

ques 4) A or B

ques 5) 200

Explanation:

Question 1)

The graph is a Euler circuit since in order to cover all the edges exactly once it start and ends at the same vertex.

Question 2)

To create a Euler path, we can start at Vertex D and end at vertex B.

and the path is given as:

DCFADBCEFGAB

Question 3)

To find the Minimal spanning tree using kruskal's Algorithm we can start with the edge AE.

As it has the least value i.e. 2.

Question 4)

A or B.

As The minimum cost in A and B is same which is 16.

Question 5)

When x=9 then y is given by:

y=20 x

i.e. y=20×9=180

Now for y>80 to be true we use the expression:

z=y+20=180+20=200

Hence z=200




User Sanket B
by
5.6k points