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

1 votes
1 answer
511
Given a maximum matching M, if we pick one endpoint of each edge in M, this form a valid vertex cover. TRUE FALSE
0 votes
1 answer
512
1 votes
1 answer
513
0 votes
1 answer
514
0 votes
0 answers
515
Let T be an n - vertex tree having one vertex of degree i for i=2,3,…,k and the remaining n−k+1 vertices are of degree 1 each. Determine n in terms of k.
0 votes
1 answer
516
Graph G has atleast 1 edge then which are truea) G has a hamiltonian circuitb) Every cycle of G is of even length
3 votes
3 answers
517
Assume undirected graph G is connected . G has 6 vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guaranteee that it will bec...
1 votes
2 answers
519
The total number of non isomorphic graph which can be formed with 3 vertices________________________
1 votes
2 answers
520
maximum number of edges in a simple planar graph with 10 vertices which contains no triangle is?
1 votes
1 answer
524
0 votes
0 answers
525
How many number of Non-isomorphism Possible Graph M vertices and E edges ? If any Shortcut Formula
1 votes
1 answer
526
if L1 ={a^n | n>=0}then L1^R is?
0 votes
1 answer
527
Matching and edge coloring are same ?
0 votes
0 answers
528
Explain isomorphism in context of groups with example
2 votes
1 answer
529
2 votes
0 answers
530
how to calculate number of directed graphs possible having n vertices?