Register

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

Filter

Most viewed questions in Graph Theory

0 votes
0 answers
361
NIELIT 2017 July Scientist B (CS) - Section B: 2
Which of the following statements is/are TRUE for an undirected graph? Number of odd degree vertices is even Sum of degrees of all vertices is even P only Q only Both P and Q Neither P nor Q
Which of the following statements is/are TRUE for an undirected graph?Number of odd degree vertices is evenSum of degrees of all vertices is evenP onlyQ onlyBoth P and QN...
User Avatar
0 votes
1 answer
362
UGC NET CSE | July 2018 | Part 2 | Question: 81
E is the number of edges in the graph and f is maximum flow in the graph. When the capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by $O \: (E*f)$ $O \: (E^2*f)$ $O \: (E*f^2)$ $O \: (E^2*f^2)$
E is the number of edges in the graph and f is maximum flow in the graph. When the capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by$O \: (E*...
User Avatar
2 votes
0 answers
363
chromatic number
Let G be a planar Graph Such that every phase is bordered by exactly 3 edges which of the following can never be value for X(G) a)2 b)3 C)4 d)none of these
Let G be a planar Graph Such that every phase is bordered by exactly 3 edges which of the following can never be value for X(G) a)2 b)3 C)4 d)none of these
User Avatar
3 votes
3 answers
365
PGEE 2017
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides y Find number of strongly connected components
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides yFind number of strongly connected com...
User Avatar
1 votes
2 answers
367
Matching in graph theory
Can anone please explain what is a perfect matching in graph theory?
Can anone please explain what is a perfect matching in graph theory?
User Avatar
1 votes
1 answer
368
Narsingh Deo Problem 2-28
User Avatar
0 votes
0 answers
370
Graph_Self Doubt
Let G be a simple graph with 11 vertices . if degree of each vertex is atleast 3 and atmost 5 , then the number of edges in G should lie between I got 16 and 28
Let G be a simple graph with 11 vertices . if degree of each vertex is atleast 3 and atmost 5 , then the number of edges in G should lie between I got 16 and 28
User Avatar
0 votes
1 answer
371
graph theory
in a directed graph if there is a directed path from any node u to v or vice versa for any pair of nodes of the graph ,the graph is? a. weakly connected unilaterally connected strongly connected disconnected
in a directed graph if there is a directed path from any node u to v or vice versa for any pair of nodes of the graph ,the graph is? a. weakly connectedunilaterally conne...
User Avatar
1 votes
1 answer
373
discrete
Given a maximum matching M, if we pick one endpoint of each edge in M, this form a valid vertex cover. TRUE FALSE
Given a maximum matching M, if we pick one endpoint of each edge in M, this form a valid vertex cover. TRUE FALSE
User Avatar
0 votes
1 answer
375
chromatic number
User Avatar
2 votes
1 answer
377
graph
Let n be a positive integer. Show that a subgraph induced by a nonempty subset of the vertex set of Kn is a complete graph.
Let n be a positive integer. Show that a subgraph induced by a nonempty subset of the vertex set of Kn is a complete graph.
User Avatar
3 votes
2 answers
378
Counting number of articulation points
Given answer is 2, I think it should be 3: F,A, and G are articulation points. Please check
Given answer is 2, I think it should be 3: F,A, and G are articulation points. Please check
User Avatar
9 votes
1 answer
379
Graph Colouring
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is
User Avatar
Page: