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

1 votes
0 answers
921
Graph
Find Maximum and Minimum no of edges in a graph G with n vertices if G has 3 component with 2 non acyclic and 1 acyclic component?
Find Maximum and Minimum no of edges in a graph G with n vertices if G has 3 component with 2 non acyclic and 1 acyclic component?
User Avatar
1 votes
0 answers
922
How many nonisomorphic simple graphs are there with n vertices, when n is a) 2? b) 3? c) 4?
I am unable to get this logic since in both of these algorithms we need to have a record of future requirement of the processes so then why is it that resource allocation graph algorithm is more efficient ?
I am unable to get this logic since in both of these algorithms we need to have a record of future requirement of the processes so then why is it that resource allocation...
User Avatar
10 votes
5 answers
925
ISRO2011-35
How many edges are there in a forest with $v$ vertices and $k$ components? $(v+1) - k$ $(v+1)/2 - k$ $v - k$ $v + k$
How many edges are there in a forest with $v$ vertices and $k$ components?$(v+1) - k$$(v+1)/2 - k$$v - k$$v + k$
User Avatar
0 votes
3 answers
926
Graph theory
User Avatar
0 votes
3 answers
927
graph coloring
7 var occurs in a loop of computer programm.The variable nd step during which they must be stored are t: step 1 through 6;u:step2;:steps 2 through 4 ;w:step 1 ,3 and 5;x:step 1 and 6;y:step3 through 6; nd z:step 4 nd 5. How many different index registers are needed to store these variables during execution?
7 var occurs in a loop of computer programm.The variable nd step during which they must be stored aret: step 1 through 6;u:step2;:steps 2 through 4 ;w:step 1 ,3 and 5;x:s...
User Avatar
6 votes
1 answer
929
how to find without edge?
A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph ? (A) 5 (B) n – 3 (C) 20 (D) 11
A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex ofdegree 2. If the other vertices have degree 1, how many vertices are there in the gra...
User Avatar
5 votes
1 answer
930
UGC NET CSE | December 2013 | Part 2 | Question: 36
How many edges are there in a forest of t-trees containing a total of n vertices ? n + t n – t n ∗ t nt
How many edges are there in a forest of t-trees containing a total of n vertices ?n + tn – tn ∗ tnt
User Avatar
3 votes
4 answers
931
maximum number of edges in a graph with components
A graph G have 9 vertices and two components. What is the maximum number of edges possible in this graph?
A graph G have 9 vertices and two components. What is the maximum number of edges possible in this graph?
User Avatar
4 votes
4 answers
932
graph coloring
What is the minimum number of colors needed to color a graph with five vertices. The graph contain a cycle also
What is the minimum number of colors needed to color a graph with five vertices. The graph contain a cycle also
User Avatar
2 votes
1 answer
933
Properties of Planar graph
Can anyone explain a connected planar graph with n vertices and e edges has e-n+2 regions??
Can anyone explain a connected planar graph with n vertices and e edges has e-n+2 regions??
User Avatar
3 votes
2 answers
934
graphs - bipartite
Q) For what value of n Kn can be bipartite a)2 b)3 c)4 d) 5
Q) For what value of n Kn can be bipartitea)2b)3c)4d) 5
User Avatar
0 votes
1 answer
935
How to approach for calculating the number of paths of length n between 2 different vertices for a complete graph K4?
If I have any complete graph given then what is the approach to be followed up for calculating the number of paths of length n because for large value of n ,computation w...
User Avatar
2 votes
2 answers
936
any relation between planar graphs and connected or disconnected graph
I just wanted to confirm that if I have a disconnected graph ,then I can call it planar .so for a graph to be planar do I need to check whether it is connected or disconnected.
I just wanted to confirm that if I have a disconnected graph ,then I can call it planar .so for a graph to be planar do I need to check whether it is connected or disconn...
User Avatar
33 votes
9 answers
937
GATE CSE 2015 Set 1 | Question: 54
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
User Avatar
28 votes
6 answers
939
GATE CSE 2015 Set 2 | Question: 28
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ is A multiple of 4 Even Odd Congruent to 0 $mod$ 4, or, 1 $mod$ 4.
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ isA multiple of 4EvenOddCongruent to 0 $mod$ 4...
User Avatar
0 votes
2 answers
940
maths_mock_test2
User Avatar
Page: