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

2 votes
2 answers
813
4 votes
1 answer
814
The number of edges in a 'n' vertex complete graph is?$n ^{*} (n - 1) / 2$$n^{2}$$n ^{*} (n + 1) / 2$$n ^{*} (n + 1)$
0 votes
2 answers
815
39.A _________ complete subgraph and a _________ subset of vertices of a graph $G = (V, E)$ are a clique and a vertex cover respectively.(A) minimal, maximal(B) minimal, ...
2 votes
1 answer
816
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
820
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?
43 votes
4 answers
821
0 votes
3 answers
822
The number of colors needed to edge color a simple graph with maximum degree Δ is?Is this there in portion?
1 votes
1 answer
823
Assume G is connected planar graph that has 14 vertices and 20 regions . All interior regions are bounded by a cycle of length 3(i.e. 3 edges). The no of edges bounded t...
1 votes
1 answer
826
3 votes
4 answers
827
number of subgraph for K3 is
1 votes
2 answers
829
A simple undirected graph ‘X’ has 10 vertices. If ‘X’ has 5 equally sized connected components, the maximum number of edges in graph ‘X’ is _________.
0 votes
1 answer
830
How many different isomorphisms are there from one cycle on n-vertices to another cycle on n-vertices.