Register
Filter

Recent activity by raun220

9 answers
1
GATE CSE 2003 | Question: 40
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-degree of $G$ cannot be $3$ $4$ $5$ $6$
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-d...
3 answers
2
GATE CSE 1987 | Question: 2g
State whether the following statements are TRUE or FALSE: If the number of leaves in a tree is not a power of $2,$ then the tree is not a binary tree.
State whether the following statements are TRUE or FALSE:If the number of leaves in a tree is not a power of $2,$ then the tree is not a binary tree.
1 answer
5
kenneth rosen chapter 8 section 8.4 example 10
The coefficient of $x^{17}$ in the expansion of $(x^2 + x^3 + x^4 + x^5)*(x^3 + x^4 + x^5 + x^6)*(x^4 + x^5 + x^6 + x^7).$
The coefficient of $x^{17}$ in the expansion of $(x^2 + x^3 + x^4 + x^5)*(x^3 + x^4 + x^5 + x^6)*(x^4 + x^5 + x^6 + x^7).$