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

Highest voted questions in Graph Theory

2 votes
0 answers
301
Gateforum test series
answer given is option A.
answer given is option A.
User Avatar
2 votes
2 answers
302
graph theory
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
User Avatar
2 votes
0 answers
303
Maths: Graph Theory
Let G be a 3-regular graph and S be a minimum vertex cut of G with |S| = 5 The the size of smallest edge cut of G is _______ (A)4 (B) 5 (C) 6 (D) None of the above
Let G be a 3-regular graph and S be a minimum vertex cut of G with |S| = 5The the size of smallest edge cut of G is _______(A)4(B) 5(C) 6(D) None of the above
User Avatar
2 votes
1 answer
304
Matchings in a Graph
User Avatar
2 votes
1 answer
305
GATE - 2014 - 1- 51 modified
Consider an directed graph G where self-loops are not allowed. The vertex set of G is {(i,j)∣1≤i≤12,1≤j≤12}There is an edge from(a,b) to (c,d) if |a−c|≤1 and |b−d|≤1. The number of edges in this graph is______
Consider an directed graph G where self-loops are not allowed. The vertex set of G is {(i,j)∣1≤i≤12,1≤j≤12}There is an edge from(a,b) to (c,d) if |a−c|≤1 an...
User Avatar
2 votes
0 answers
308
Graph colouring
Consider a tree with n nodes where and node can adjacent to maximum 4 other nodes .then what is the minimum number of colours needed to colour the tree so that no two adjacent nodes get the same colour
Consider a tree with n nodes where and node can adjacent to maximum 4 other nodes .then what is the minimum number of colours needed to colour the tree so that no two adj...
User Avatar
2 votes
0 answers
309
Graph Theory: Degree of a region
In the given following planar graph, what is the degree of the region R1:
In the given following planar graph, what is the degree of the region R1:
User Avatar
2 votes
0 answers
310
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
2 votes
0 answers
312
schedule graph
User Avatar
2 votes
2 answers
314
UGC NET CSE | June 2009 | Part 2 | Question: 12
The complete graph with four vertices has $k$ edges where $k$ is : $3$ $4$ $5$ $6$
The complete graph with four vertices has $k$ edges where $k$ is :$3$ $4$ $5$ $6$
User Avatar
2 votes
1 answer
316
Min Cut set
User Avatar
2 votes
0 answers
317
Directed graph
how to calculate number of directed graphs possible having n vertices?
how to calculate number of directed graphs possible having n vertices?
User Avatar
2 votes
0 answers
319
counting
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 15 30 90 360
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 to153090360
User Avatar
2 votes
3 answers
320
Kenneth Rosen Edition 7 Exercise 10.8 Question 23 (Page No. 734)
Find the edge chromatic numbers of a) Cn, where n ≥ 3. (Cycle with n vertices) b) Wn, where n ≥ 3 (Wheel with n vertices) c)Complete graph with n vertices.
Find the edge chromatic numbers ofa) Cn, where n ≥ 3. (Cycle with n vertices)b) Wn, where n ≥ 3 (Wheel with n vertices)c)Complete graph with n vertices.
User Avatar
Page: