Let G=(V, E) be a graph. Define $\xi(G) = \sum\limits_d i_d*d$, where $i_d$ is the number of vertices of degree $d$ in G. If S and T are two different trees with $\xi(S) = \xi(T)$, then
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- In the following graph, the number of trees (P) and the number of cut-set (Q) are $ satisfies $|E| \leq 3 |V| - 6$. The min-degree of $G$ is defined as $ min_{v\in V} \left ...
- Consider the following statements: (a) In isogamy, the fusion of two different types of gametes takes place...
- Directions: Make sentence from the words given in a jumbled order. has a degree in (A)/ his credit (B)/ the...
- Directions: Make sentence from the words given in each item in a jumbled order. tense (A)/ between the two ...
- Let the binary heap has depth equal to d. What is the minimum number of nodes in the heap?
- Which of the above two statements define the equals and hashcode contract in JAVA? Statement -1 If two obje...
- Consider the following statements. (a) The heterozygote's phenotype is intermediate between those of the tw...