# Discrete Math

2) From image 1,2 find if they are Eulerian and Hamiltonian Graphs for each of them.

3) Consider the graph G with vertices $\{2,3,6,7,9,10,11,22\}$ and edges the pairs ${i,j}$ for which greatest_common_divisor$(i,j)≠1$

How many coherent components does G have? (Hint: draw the graph and measure the coherent components).

## Answer

**Answers can be viewed only if**

- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.

1 Attachment

The answer is accepted.

Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.

- answered
- 313 views
- $30.00

### Related Questions

- Discrete Math Question
- Logic Question (𝐴→(𝐵→𝐶))→((𝐴→𝐵)→(𝐴→𝐶))
- Solve summation problem: $\sum_{k=1}^{n} \tfrac{2k+1}{k^{2}(k+1)^2 } $
- Discrete Structures - Proving a statement true
- Problem Help - Matrix/Markov
- Find the generating function
- Discrete Math- Number of factor trees of a graph
- Count the number of decks of cards, where no king is on top of the ace of the same suit.

What makes a component "coherent"? Is that a synonym for "connected"?

coherent means connected yes. Thats the meaning