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
151
NIELIT 2017 July Scientist B (IT) - Section B: 3
A path in graph $G$, which contains every vertex of $G$ and only once? Euler circuit Hamiltonian path Euler Path Hamiltonian Circuit
A path in graph $G$, which contains every vertex of $G$ and only once?Euler circuitHamiltonian pathEuler PathHamiltonian Circuit
User Avatar
0 votes
1 answer
152
NIELIT 2017 July Scientist B (IT) - Section B: 5
In a given following graph among the following sequences: abeghf abfehg abfhge afghbe Which are depth first traversals of the above graph? I,II and IV only I and IV only II,III and IV only I,III and IV only
In a given following graph among the following sequences: abeghf abfehgabfhgeafghbe Which are depth first traversals of the above graph?I,II and IV onlyI and IV onlyII,II...
User Avatar
1 votes
1 answer
153
NIELIT 2017 July Scientist B (IT) - Section B: 6
Considering the following graph, which one of the following set of edges represents all the bridges of the given graph? $(a,b), (e,f)$ $(a,b), (a,c)$ $(c,d), (d,h)$ $(a,b)$
Considering the following graph, which one of the following set of edges represents all the bridges of the given graph?$(a,b), (e,f)$$(a,b), (a,c)$$(c,d), (d,h)$$(a,b)$
User Avatar
1 votes
1 answer
155
NIELIT 2017 July Scientist B (IT) - Section B: 8
A connected planar graph divides the plane into a number of regions. If the graph has eight vertices and these are linked by $13$ edges, then the number of regions is: $5$ $6$ $7$ $8$
A connected planar graph divides the plane into a number of regions. If the graph has eight vertices and these are linked by $13$ edges, then the number of regions is:$5$...
User Avatar
1 votes
1 answer
156
NIELIT 2017 July Scientist B (IT) - Section B: 12
Let $G$ be a simple connected planar graph with $13$ vertices and $19$ edges. Then, the number of faces in the planar embedding of the graph is $6$ $8$ $9$ $13$
Let $G$ be a simple connected planar graph with $13$ vertices and $19$ edges. Then, the number of faces in the planar embedding of the graph is$6$$8$$9$$13$
User Avatar
0 votes
1 answer
157
NIELIT 2017 July Scientist B (IT) - Section B: 15
The number of diagonals that can be drawn by joining the vertices of an octagon is $28$ $48$ $20$ None of the option
The number of diagonals that can be drawn by joining the vertices of an octagon is$28$$48$$20$None of the option
User Avatar
0 votes
0 answers
158
NIELIT 2017 July Scientist B (CS) - Section B: 2
Which of the following statements is/are TRUE for an undirected graph? Number of odd degree vertices is even Sum of degrees of all vertices is even P only Q only Both P and Q Neither P nor Q
Which of the following statements is/are TRUE for an undirected graph?Number of odd degree vertices is evenSum of degrees of all vertices is evenP onlyQ onlyBoth P and QN...
User Avatar
0 votes
4 answers
159
NIELIT 2017 July Scientist B (CS) - Section B: 11
Consider the following graph $L$ and find the bridges,if any. No bridge $\{d,e\}$ $\{c,d\}$ $\{c,d\}$ and $\{c,f\}$
Consider the following graph $L$ and find the bridges,if any.No bridge$\{d,e\}$$\{c,d\}$$\{c,d\}$ and $\{c,f\}$
User Avatar
0 votes
3 answers
160
NIELIT 2017 July Scientist B (CS) - Section B: 12
The following graph has no Euler circuit because It has $7$ vertices. It is even-valent (all vertices have even valence). It is not connected. It does not have a Euler circuit.
The following graph has no Euler circuit becauseIt has $7$ vertices.It is even-valent (all vertices have even valence).It is not connected.It does not have a Euler circui...
User Avatar
0 votes
7 answers
161
NIELIT 2017 July Scientist B (CS) - Section B: 13
For the graph shown, which of the following paths is a Hamilton circuit? $ABCDCFDEFAEA$ $AEDCBAF$ $AEFDCBA$ $AFCDEBA$
For the graph shown, which of the following paths is a Hamilton circuit?$ABCDCFDEFAEA$$AEDCBAF$$AEFDCBA$$AFCDEBA$
User Avatar
0 votes
4 answers
162
NIELIT 2017 July Scientist B (CS) - Section B: 14
If $G$ is an undirected planar graph on $n$ vertices with $e$ edges then $e\leq n$ $e\leq 2n$ $e\leq 3n$ None of the option
If $G$ is an undirected planar graph on $n$ vertices with $e$ edges then$e\leq n$$e\leq 2n$$e\leq 3n$None of the option
User Avatar
0 votes
1 answer
164
NIELIT 2017 DEC Scientist B - Section B: 23
Let $G$ be a complete undirected graph on $8$ vertices. If vertices of $G$ are labelled, then the number of distinct cycles of length $5$ in $G$ is equal to: $15$ $30$ $56$ $60$
Let $G$ be a complete undirected graph on $8$ vertices. If vertices of $G$ are labelled, then the number of distinct cycles of length $5$ in $G$ is equal to:$15$$30$$56$$...
User Avatar
1 votes
4 answers
165
NIELIT 2017 DEC Scientist B - Section B: 52
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is $n(n-1)/2$ $n^{n-2}$ $nx$ $n$
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is$n(n-1)/2$$n^{n-2}$$nx$$n$
User Avatar
1 votes
2 answers
166
UGC NET CSE | December 2007 | Part 2 | Question: 2
The number of edges in a complete graph with $‘n’$ vertices is equal to : $n(n-1)$ $\large\frac{n(n-1)}{2}$ $n^2$ $2n-1$
The number of edges in a complete graph with $‘n’$ vertices is equal to :$n(n-1)$$\large\frac{n(n-1)}{2}$$n^2$$2n-1$
User Avatar
1 votes
2 answers
167
UGC NET CSE | December 2006 | Part 2 | Question: 3
The number of edges in a complete graph with $N$ vertices is equal to : $N (N−1)$ $2N−1$ $N−1$ $N(N−1)/2$
The number of edges in a complete graph with $N$ vertices is equal to :$N (N−1)$$2N−1$$N−1$$N(N−1)/2$
User Avatar
0 votes
1 answer
168
UGC NET CSE | December 2004 | Part 2 | Question: 4
The following lists are the degrees of all the vertices of a graph : $1,2,3,4,5$ $3,4,5,6,7$ $1, 4, 5, 8, 6$ $3,4,5,6$ (i) and (ii) (iii) and (iv) (iii) and (ii) (ii) and (iv)
The following lists are the degrees of all the vertices of a graph :$1,2,3,4,5$$3,4,5,6,7$$1, 4, 5, 8, 6$$3,4,5,6$(i) and (ii)(iii) and (iv)(iii) and (ii)(ii) and (iv)
User Avatar
0 votes
1 answer
169
UGC NET CSE | December 2004 | Part 2 | Question: 23
Weighted graph : Is a bi-directional graph Is directed graph Is graph in which number associated with arc Eliminates table method
Weighted graph :Is a bi-directional graphIs directed graphIs graph in which number associated with arcEliminates table method
User Avatar
Page: