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{2024-1} &\textbf{2024-2} &\textbf{2023} &\textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} &1&1&0& 1&1&0&0&0.83&1
\\\hline\textbf{2 Marks Count} &1&2&1& 3 &1&0&0&1.33&3
\\\hline\textbf{Total Marks} & 3&5&2&7 &3&0&\bf{0}&\bf{3.33}&\bf{7}\\\hline
\end{array}}}$$

Filter

Recent questions in Graph Theory

0 votes
0 answers
21
Made easy test series
Consider a strongly connected directed graph G(V, F), where |V| = 101. The minimum possible value of IEl is
Consider a strongly connected directed graph G(V, F), where |V| = 101. The minimum possible value of IEl is
User Avatar
0 votes
0 answers
24
Find the MIS and MaxIS
User Avatar
0 votes
1 answer
25
#self doubt
Domination set and MIS are the same?
Domination set and MIS are the same?
User Avatar
0 votes
1 answer
26
Regular and complete graph
which of the following statements is true: a complete graph is $(N-1)$ regular a $(N-1)$ regular is a complete graph
which of the following statements is true:a complete graph is $(N-1)$ regulara $(N-1)$ regular is a complete graph
User Avatar
0 votes
0 answers
27
#self_doubt#pyq#graphtheory
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to the answer is 45 but for the following cases, what will be the answer? 1- if the graph is directed 2- if vertices are not labeled.
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal tothe answer is 45 but for ...
User Avatar
0 votes
0 answers
28
made easy test series
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 to ask can someone help me {hint}
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...
User Avatar
0 votes
1 answer
29
#applied course
how many regions are in the above graph and please explain with region formula also. r=e-v+(c+1) my attempt is : r=5-5+2 r=2 but the rule is twice the no of boundary edges which is (5*2) = sum of region degrees which (4+5=9 ) can someone explain where the fault is
how many regions are in the above graph and please explain with region formula also.r=e-v+(c+1)my attempt is :r=5-5+2r=2but the rule is twice the no of boundary edges whi...
User Avatar
0 votes
1 answer
30
Self doubt
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two vertices a, b, only at most one of the edges (a, b) and (b, a) is in the graph.)
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two ver...
User Avatar
2 votes
1 answer
33
Chromatic Number
User Avatar
0 votes
2 answers
35
Ace workbook: If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉
User Avatar
1 votes
2 answers
36
Graphy theory Gate wallah practice sheet #6
Consider a complete graph with size 2016. Suppose after deletion of 2 vertices from the above graph, the modified graph have x number of edges and y number of vertices. Find the value of x – y ?
Consider a complete graph with size 2016. Suppose after deletion of 2 vertices from the above graph, the modified graph have x number of edges and y number of vertices. F...
User Avatar
0 votes
1 answer
37
#Graph Theory
Prove that following graph does not have Hamiltonian cycle.
Prove that following graph does not have Hamiltonian cycle.
User Avatar
0 votes
1 answer
38
What is Kurawtoski Graph?
User Avatar
0 votes
1 answer
39
Graph theory self doubt
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
User Avatar
0 votes
1 answer
40
Planar Graphs | Graph Theory | Selfdoubt
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
User Avatar
Page: