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

Recent questions in Graph Theory

0 votes
0 answers
361
Graph Theory
User Avatar
0 votes
1 answer
365
ACE Bits and bYtes
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
User Avatar
1 votes
1 answer
366
ACE Bits And Bytes
Number of perfect matching in Wn (n>=4 and n is even) _________.
Number of perfect matching in Wn (n>=4 and n is even) _________.
User Avatar
0 votes
1 answer
368
Graphs
User Avatar
0 votes
1 answer
369
Graphs
I think ans is option C , But will anybody explain the notation used in option D ?
I think ans is option C , But will anybody explain the notation used in option D ?
User Avatar
0 votes
1 answer
370
me test
A simple graph with n vertices is constructed by randomly and independently placing an edge between every two vertices with probability p. What is the expected no. of nodes with degree 2?
A simple graph with n vertices is constructed by randomly and independently placing an edge between every two vertices with probability p. What is the expected no. of nod...
User Avatar
0 votes
0 answers
372
graph theory
10.A graph G has any two vertices connected by exactly one path. Find the Number of ways we can properly colour G it we are provided with 10 colours.
10.A graph G has any two vertices connected by exactly one path. Find theNumber of ways we can properly colour G it we are provided with 10colours.
User Avatar
0 votes
1 answer
373
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
1 votes
1 answer
374
SELF DOUBT PREFIX
WE CAN USE STACK TO EVALUATE PREFIX EXPRESSION .THIS STATEMENT IS TRUE OR FALSE IF THEN HOW?? EXPRESSION IS + - * 2 3 5 / ^ 2 3 4
WE CAN USE STACK TO EVALUATE PREFIX EXPRESSION .THIS STATEMENT IS TRUE OR FALSE IF THEN HOW??EXPRESSION IS + - * 2 3 5 / ^ 2 3 4
User Avatar
0 votes
1 answer
376
SELF DOUBT DM ROSEN
Find the least number of comparisons needed to sort five element. I AM GETTING 7 AS (LOG 5!) =7........
Find the least number of comparisons needed to sort five element. I AM GETTING 7 AS (LOG 5!) =7........
User Avatar
0 votes
1 answer
377
rosen
User Avatar
1 votes
1 answer
379
self doubt
in a rooted tree if we are asked to find the level of root then it should be 0 or 1 or question depending ??
in a rooted tree if we are asked to find the level of root then it should be 0 or 1 or question depending ??
User Avatar
0 votes
0 answers
380
How to find even or odd cylce in a graph
Consider this example , There is even vertices cycle as well as odd vertices cycle as per my understanding, let me know if it correct. Thanks a lot
Consider this example , There is even vertices cycle as well as odd vertices cycle as per my understanding, let me know if it correct.Thanks a lot
User Avatar
Page: