Which of the following graphs have hamiltonian circuits? I M N K DA 0 OC I H E F G H C H OD E B D

answer the correct please. this is in discrete math

9. Let G2 be depicted in the following diagram: b h a d 9(d) Give an example of a walk of length five in G2 that is not a path.

In the following graph, find a Hamiltonian path and prove that no Hamiltonian cycle exists. a a m d h k f 00 g b n C

2. Use adjacent list and adjacent matrix the represent thc following graphs. d.

Need help on this question. Thank you :)

The symmetric difference graph of two graphs G. (V. E.) and G₂ (V₁ E₂) on the same vertex Set is defined as G₁ AG₂:= (V, E, DE₂). E₁ DE ₂ = (E₁ \ E₂) U (E₂\E.) : E₁ E₂ = €₁ 0 € ₂ If G₁ and 6₂ are euleran, show that every Vertex in G, D G₂ has even degree FACT: Each vertex of a evlenan graph has even degree. SO: Show G₁ D G₂ is eulerian.

Need help with this question. Thank you :)