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
1 answer
631
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
632
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
633
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
634
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
636
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
637
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
638
MADE EASY TEST SERIES
User Avatar
7 votes
2 answers
640
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
641
#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
642
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
0 votes
1 answer
646
Test Book Test
An Undirected graph G with only one simple path between each pair of vertices has two vertices of degree 4, one vertex of degree 3 and two vertices of degree 2. Number of vertices of degree 1 are _____________ ?
An Undirected graph G with only one simple path between each pair of vertices has two vertices of degree 4, one vertex of degree 3 and two vertices of degree 2. Number of...
User Avatar
0 votes
1 answer
648
Graph
User Avatar
2 votes
1 answer
650
graph theory
Assumed undirected graph G is connected. G has 6­vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guarantee that it will become disconnected.
Assumed undirected graph G is connected. G has 6­vertices and 10 edges. Findthe minimum number of edges whose deletion from graph G is always guaranteethat ...
User Avatar
Page: