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).
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.
- answered
- 220 views
- $30.00
Related Questions
- Recursive Set
- Set Theory Question Help
- How many balanced lists of n left and n right parentheses are there?
- Logic Question 𝐴→(𝐵→𝐶),𝐴→𝐵,𝐴⊢𝐶
- Solve summation problem: $\sum_{k=1}^{n} \tfrac{2k+1}{k^{2}(k+1)^2 } $
- Markov Process Problem
- Finding a unique structure of the domain of a function that gives a unique intuitive average?
- Discrete Math/ Set theory Question
