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
1 answer
665
Graph_Theory
A graph has a degree sequence <1,1,2,2,3,3,3,3> the number of edges in the graph? a) 18 b)9 c)36 d)8
A graph has a degree sequence <1,1,2,2,3,3,3,3 the number of edges in the graph?a) 18 b)9 c)36 d)8
User Avatar
0 votes
1 answer
666
no. of edges
A graph G has k isolated vertices and n + k vertices. The maximum number of edges graph G can have? a) n(n-1) b)n(n-1)/2) c) n(n-k+1)/2 d) n(n+k-1)/2
A graph G has k isolated vertices and n + k vertices. The maximum number of edges graph G can have?a) n(n-1) b)n(n-1)/2) c) n(n-k+1)/2 d) n(n+k-1)/2
User Avatar
0 votes
1 answer
667
Graphs
A sequence d = is graphic if there is a simple non-directed graph with degree sequence d then which one of the following sequences is graphic? a) (2, 3, 3, 4, 4, 5) b) (1, 3, 3, 3) c) (2, 3, 3, 4, 5, 6, 7) d) (2, 3, 3, 3, 3)
A sequence d = is graphic if there is a simple non-directed graph with degree sequence d then which one of the following sequences is graphic?a) (2, 3, 3, 4, 4, 5) b) (1,...
User Avatar
1 votes
1 answer
668
Graph
1. Suppose that G is a non-directed graph with 12 edges. Suppose that G has 6 vertices of degree 3 and the rest have degrees less than 3. The minimum number of vertices G can have? a) 2 b) 0 c)1 d)3 I am getting 3..plz verify
1. Suppose that G is a non-directed graph with 12 edges. Suppose that G has 6 vertices of degree 3 and the rest have degrees less than 3. The minimum number of vertices G...
User Avatar
0 votes
1 answer
669
Graph Theory Problem-Test Series
A Connected Graph has Cut edge, Then Graph has Cut vertex also. 1. True 2. False Choose Correct One.
A Connected Graph has Cut edge, Then Graph has Cut vertex also.1. True2. FalseChoose Correct One.
User Avatar
0 votes
1 answer
670
GRAPH_degree seq
Is there any simple graph with degree sequence <1,1,1,1,2,2,3,3,3,3>
Is there any simple graph with degree sequence<1,1,1,1,2,2,3,3,3,3>
User Avatar
0 votes
1 answer
672
Graph Theory
Let G be a undirected graph with 35 edges and degree of each vertex is at least 3 then maximum number of vertices possible in G is (A) 22 (B) 23 (C) 24 (D) 25 P.S. Explain with ease, if possible!
Let G be a undirected graph with 35 edges and degree of each vertex is at least 3 then maximum number of vertices possible in G is(A) 22(B) 23(C) 24(D) 25P.S. Explain wit...
User Avatar
0 votes
1 answer
673
Graph Theory
How to learn and understand graph theory in 23 days i mean before gate exam? Can anybody help in this.Like there are many new terms bipartite graph etc etc i m not able to learn some complicated names ? Any video lectures or anything please help :)
How to learn and understand graph theory in 23 days i mean before gate exam? Can anybody help in this.Like there are many new terms bipartite graph etc etc i m not able ...
User Avatar
1 votes
2 answers
674
MADE EASY TEST SERIES
User Avatar
7 votes
2 answers
676
Non-isomorphic graphs
How many non-isomorphic simple graph are there with N vertices, where N = 4 ?
How many non-isomorphic simple graph are there with N vertices, where N = 4 ?
User Avatar
0 votes
0 answers
677
#nlc payment
@ arjun sir for nlc application i have done sbi collect payment 2 days before but still nlc is showing fee paid status as not paid what to do now
@ arjun sir for nlc application i have done sbi collect payment 2 days before but still nlc is showing fee paid status as not paid what to do now
User Avatar
0 votes
1 answer
678
Number of Sums
The function for finding the fibonacci series is given as follows : The number of additions taken in evaluating fib(5) is. Your Answer: 4 Correct Answer: 7 Status: incorrect
The function for finding the fibonacci series is given as follows :The number of additions taken in evaluating fib(5) is.Your Answer:4Correct Answer: 7 Status: incorre...
User Avatar
Page: