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

2 votes
2 answers
362
2 votes
1 answer
363
How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?M+N-CM-N-CM-N+CM+N+C
2 votes
3 answers
364
In N-cube graph we have no. of vertices = $2^N$ and no. of edges = $N*2^{N-1}$Can anyone explain how we get this no. of edges?
2 votes
1 answer
365
2 votes
1 answer
366
Given explanation:I couldn't understand why S1 is false. Please explain
2 votes
1 answer
367
How many non isomorphic directed simple graph are there with n vertices?
2 votes
0 answers
369
for the recurrence relation an=6an-1-9an-2 + F n , what will be the particular solutionif case 1; F n = 3n 5n+1 case 2; F n = 2n 5n+1
2 votes
1 answer
371
Kuratowski's second graph is not planar then why it dont contradict for following inequality for checking planarity :e<=3n-6=>(e=9)<=3*(n=6)-6=>9<=12 , which is true
2 votes
1 answer
372
is there is any difference between isolated vertex and null graph???both are same or not???
2 votes
1 answer
374
Draw a eular graph which is not hamiltonian
2 votes
1 answer
375
Can anyone explain a connected planar graph with n vertices and e edges has e-n+2 regions??
2 votes
2 answers
376
I just wanted to confirm that if I have a disconnected graph ,then I can call it planar .so for a graph to be planar do I need to check whether it is connected or disconn...
2 votes
2 answers
377
1 votes
2 answers
378
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is __________.