# 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).

Kratos

55

## Answer

**Answers can only be viewed under the following conditions:**

- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.

1 Attachment

Kav10

1.9K

The answer is accepted.

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

- answered
- 620 views
- $30.00

### Related Questions

- Logic Question π΄∨π΅→πΆβ’(π΄→πΆ)∧(π΅→πΆ)
- Solve summation problem: $\sum_{k=1}^{n} \tfrac{2k+1}{k^{2}(k+1)^2 } $
- Logic Question π΄∧(π΅∨πΆ)β’(π΄∧π΅)∨(π΄∧πΆ)
- Logic Question π΄→(π΅→πΆ),π΄→π΅,π΄β’πΆ
- Let A be an uncountable set, B a countable subset of A, and C the complement of B in A. Prove that there exists a one-to-one correspondence between A and C.
- Discrete math
- Logic Questions (π΄→πΆ)∧(π΅→πΆ)β’(π΄∧π΅)→πΆ
- In how many different ways $n$ persons can seat around a round table?

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

coherent means connected yes. Thats the meaning