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}}}$$

Recent questions in Graph Theory

3 votes
2 answers
92
13 votes
5 answers
93
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
3 votes
3 answers
95
1 votes
1 answer
96
In an undirected graph, if we add the degrees of all vertices, it is:oddevencannot be determinedalways $n+1,$ where $n$ is number of nodes
2 votes
2 answers
97
3 votes
3 answers
100
1 votes
1 answer
101
If a planner graph, having $25$ vertices divides the plane into $17$ different regions. Then how many edges are used to connect the vertices in this graph.$20$$30$$40$$50...
0 votes
2 answers
102
The number of ways to cut a six sided convex polygon whose vertices are labeled into four triangles using diagonal lines that do not cross is$13$$14$$12$$11$
1 votes
1 answer
104
0 votes
1 answer
105
0 votes
1 answer
107
0 votes
1 answer
108
1 votes
1 answer
109
Considering the following graph, which one of the following set of edges represents all the bridges of the given graph?$(a,b), (e,f)$$(a,b), (a,c)$$(c,d), (d,h)$$(a,b)$