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

Questions without an upvoted answer in Graph Theory

0 votes
0 answers
4
Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex r to u hasw...
0 votes
1 answer
5
Maximum number of Simple graphs possible with $n$ vertices$2^{n(n-1)/2}$$2^{(n-1)/2}$$2^{n(n+1)/2}$$2^{n(n+1)}$
0 votes
1 answer
6
If there are five faces and nine vertices in an undirected planar graph, then number of edges is14612None of the above
0 votes
0 answers
8
Consider a strongly connected directed graph G(V, F), where |V| = 101. The minimum possible value of IEl is
0 votes
0 answers
11
0 votes
1 answer
12
Domination set and MIS are the same?
0 votes
1 answer
13
which of the following statements is true:a complete graph is $(N-1)$ regulara $(N-1)$ regular is a complete graph
0 votes
0 answers
14
0 votes
0 answers
15
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 12 edges and 9 nodes. Then how many columns of A are independent?what this question want...
0 votes
1 answer
16
2 votes
1 answer
18
0 votes
1 answer
20
0 votes
1 answer
21
0 votes
1 answer
22
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
0 votes
1 answer
23
1 votes
1 answer
24
2 votes
0 answers
27
The maximum number of edges possible in a graph G with 9 vertices which is 3 colourable is equal toA 24B 27C 36D None of the above
To see more, click for the full list of questions or popular tags.