If any of the graphs below have a Hamiltonian circuit, list the vertices of the complete circuit. There may be many possibilities. For full credit, just list one for each graph, if the circuit exists

9514 1404 393

Step-by-step explanation:

A Hamiltonian circuit visits each node once and returns to its start. There is no simple way to determine if such a circuit exists.

__

For graph 2, if there were a circuit, paths ACB, ADB, and AEB would all have to be on it. Inclusion of all of those requires visiting nodes A and B more than once, so the circuit cannot exist.

__

For graph 3, the circuit must include paths BAD and DFE. That only leaves node C, which can be reached from both nodes B and E, so path ECB completes the circuit.

3

step-by-step explanation:

in standard form:

a= dictionaries

b= maps

you have to buy 3 dictionaries, so put a 3 next to the a (dictionaries) so that you can multiply them by each other.

a3+b= 60 (the amount of money you have)

we already know the cost of a=15 so replace a with $15

($15 x 3)+b=60

multiply 15 and 3 to get $45 and replace it with $45

45+b=60

and then replace b with 15 to get the total:

45+15=60

that means you have $15 left after buying 3 dictionaries.

15 divided by the cost of a map ($5) equals 3.

so you can buy 3 maps.

sorry if it was confusing!