Discrete Math
1) Let $T$ be a tree with 47 vertices with the property that removing a vertex (and its adjacent edges) from $T $ creates two coherent components $T_1,T_2$ which are also trees. For$ i=1,2,$ we denote by Vi the number of vertices of Ti and by Ei the number of edges of $T_i$ . If $|V1|=|E2|+7$ find $|V1|$.
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).

55
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
1.1K
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
- 432 views
- $30.00
Related Questions
- Probability of making a full house in a poker hand
- Logic Questions (𝐴→𝐶)∧(𝐵→𝐶)⊢(𝐴∧𝐵)→𝐶
- Discrete Math/ Set theory Question
- [Discrete Mathematics] Induction
- [Discrete Mathematics] Big-O Notation
- Discrete math
- [Discrete Mathematics] For {1,3,6,10,15,…}. Find a recursive formula.
- Problem Help - Matrix/Markov
What makes a component "coherent"? Is that a synonym for "connected"?
coherent means connected yes. Thats the meaning