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

0 votes
1 answer
302
Please help with the following:-1)How to determine if a graph is bipartite or not?2)What is meant by ordered pair in case of a directed graph and unordered pair in case o...
1 votes
1 answer
306
0 votes
0 answers
307
If G is an undirected planar graph on n vertices with e edges thenA) e<=nB) e<=2nC) e<=3nD) None of the optionplz explain it with solutions
0 votes
2 answers
308
How 14? I am not able to understand. Why not 30.
0 votes
0 answers
309
0 votes
0 answers
310
What is converse of a graph?
1 votes
0 answers
311
1 votes
1 answer
312
Find the number of connected Eulerian graphs with 6 unlabelled vertices.Draw each of them.Note: I'm looking for a fast procedure don't comment just the numerical answer.
1 votes
3 answers
313
For a complete graph with 10 vertices, The number of spanning trees is at least_____?
0 votes
1 answer
314
In tree for every pair of vertices u!=v in G their is exactly 1 path from u to v .Please help me to prove this
1 votes
2 answers
315
What is the maximum integer value m such that every simple connected graph with r vertices and r+2 edges contains at least m different spanning trees ?1)12)43)84)m
0 votes
1 answer
316
If a graph with 10 vertices having each vertex having degree >=5 find graph connected or disconnected
0 votes
0 answers
317