Web Page

Syllabus: Connectivity, Matching, Coloring.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 1&1&0&0&1&1&0&1&0&1&0&0.6&1
\\\hline\textbf{2 Marks Count} & 3 &1&0&1&1&1&0&0&0&0&0&0.7&3
\\\hline\textbf{Total Marks} & 7 &3&0&2&3&3&0&1&0&1&\bf{0}&\bf{2}&\bf{7}\\\hline
\end{array}}}$$

Highest voted questions in Graph Theory

5 votes
2 answers
151
Let $G$ be a graph of order $8$ in which every vertex has equal degree $D$. In order to guarantee that $G$ is connected, the minimum value of $D$ must be ____________
5 votes
2 answers
152
5 votes
2 answers
153
Two graphs A and B are shown below: Which one of the following statements is true?Both A and B are planarNeither A nor B is planarA is planar and B is notB is planar and ...
5 votes
2 answers
154
the solution to the recurrence relation T(n)= T(n-1) +n, T(0)=2 is..what is approach to solve it??
5 votes
0 answers
155
5 votes
1 answer
156
5 votes
1 answer
157
4 votes
2 answers
168
4 votes
1 answer
169
4 votes
2 answers
170
Q.A tree has n2 vertices of degree 2,n3 vertices of degree 3.....and nk vertices of degree k.How many vertices of degree 1 does it have ?a)n2+2n4+3n5+.......+(k-2)nk+1b)n...