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

Hot questions in Graph Theory

2 votes
3 answers
331
What is the chromatic number of following graphs?1)2)
7 votes
1 answer
332
4 votes
3 answers
336
Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is2451495048519900
2 votes
1 answer
338
0 votes
0 answers
340
how solve getting different answer???
0 votes
2 answers
341
In a connected simple graph with 30 edges the maximum number of vertices possible are
1 votes
1 answer
343
0 votes
0 answers
344
If G is a connected simple graph with 10 vertices in which degree of every vertex is 2 then number of cut edges in G is ?
5 votes
0 answers
345
Calculate the number of Spanning trees possible for each of these graphs
0 votes
2 answers
346
Can anyone explain how this is to be solved?
2 votes
0 answers
347
0 votes
0 answers
349
A quick question Is every multiplication modulo function a Abelian group....Or is it the case that the function should have prime number as modulo
0 votes
1 answer
350