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

Most viewed questions in Graph Theory

1 votes
2 answers
122
UGC NET CSE | December 2010 | Part 2 | Question: 4
The minimum number of edges in a connected graph with $‘n’$ vertices is equal to $n (n – 1)$ $\frac{n(n-1)}{2}$ $n^{2}$ $n – 1$
The minimum number of edges in a connected graph with $‘n’$ vertices is equal to$n (n – 1)$ $\frac{n(n-1)}{2}$$n^{2}$$n – 1$
User Avatar
1 votes
2 answers
123
An undirected graph G has n vertices and n-1 edges then G is
An undirected graph G has n vertices and n-1 edges then G is A. Cyclic B. Addition of edge will make it cyclic C. Eulerian D. Is a Tree
An undirected graph G has n vertices and n-1 edges then G isA. CyclicB. Addition of edge will make it cyclicC. EulerianD. Is a Tree
User Avatar
1 votes
1 answer
124
Rosen 8.2.54.
If G is a simple graph with 15 edges and $\bar{G}$ has 13 edges, how many vertices does G have?
If G is a simple graph with 15 edges and $\bar{G}$ has 13 edges, how many vertices does G have?
User Avatar
48 votes
3 answers
126
GATE CSE 1991 | Question: 16-b
Show that all vertices in an undirected finite graph cannot have distinct degrees, if the graph has at least two vertices.
Show that all vertices in an undirected finite graph cannot have distinct degrees, if the graph has at least two vertices.
User Avatar
2 votes
2 answers
128
An undirected graph is Eulerian if and only if all vertices of G are of the sum of the degrees of all nodes is
An undirected graph is Eulerian if and only if all vertices of G are of the sum of the degrees of all nodes isA. Same degreeB. ODD degreeC. Need not be ODDD. ...
User Avatar
3 votes
3 answers
129
Ace Test Series: Graph Theory - Number Of Spanning Trees
How to approach such questions ? Please provide detailed solution. Answer given is option C
How to approach such questions ? Please provide detailed solution. Answer given is option C
User Avatar
10 votes
5 answers
132
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
4 votes
3 answers
133
UGC NET CSE | June 2012 | Part 3 | Question: 72
$G_1$ and $G_2$ are two graphs as shown: Both $G_1$ and $G_2$ are planar graphs Both $G_1$ and $G_2$ are not planar graphs $G_1$ is planar and $G_2$ is not planar $G_1$ is not planar and $G_2$ is planar
$G_1$ and $G_2$ are two graphs as shown:Both $G_1$ and $G_2$ are planar graphsBoth $G_1$ and $G_2$ are not planar graphs$G_1$ is planar and $G_2$ is not planar$G_1$ is no...
User Avatar
0 votes
1 answer
134
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
3 votes
2 answers
135
UGC NET CSE | June 2013 | Part 2 | Question: 43
Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form? -42 -22 -21 -106
Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form?-42-22-21-106
User Avatar
8 votes
1 answer
136
ISRO2008-78
Consider the graph shown in the figure below: Which of the following is a valid strong component? $a, c, d$ $a, b, d$ $b, c, d$ $a, b, c$
Consider the graph shown in the figure below:Which of the following is a valid strong component?$a, c, d$$a, b, d$$b, c, d$$a, b, c$
User Avatar
15 votes
4 answers
138
GATE CSE 1988 | Question: 2xvi
Write the adjacency matrix representation of the graph given in below figure.
Write the adjacency matrix representation of the graph given in below figure.
User Avatar
8 votes
2 answers
139
ISRO2007-07
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is $1$ $k$ $k-1$ $k/2$
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is$1$$k$$k-1$$k/2$
User Avatar
1 votes
4 answers
140
UGC NET CSE | December 2013 | Part 2 | Question: 39
A graph is non-planar if and only if it contains a subgraph homomorphic to $K_{3,2} \text{ or } K_5$ $K_{3,3} \text{ or } K_6$ $K_{3,3} \text{ or } K_5$ $K_{2,3} \text{ or } K_5$
A graph is non-planar if and only if it contains a subgraph homomorphic to$K_{3,2} \text{ or } K_5$$K_{3,3} \text{ or } K_6$$K_{3,3} \text{ or } K_5$$K_{2,3} \text{ or } ...
User Avatar
Page: