search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Web Page

Syllabus: Connectivity, Matching, Coloring.

$$\small{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\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&1&0&1&0&0.7&1
\\\hline\textbf{2 Marks Count}&1&1&0&0&0&0&0&0.3&1
\\\hline\textbf{Total Marks}&3&3&0&1&0&1&\bf{0}&\bf{1.3}&\bf{3}\\\hline
\end{array}}}$$

Recent questions in Graph Theory

1 vote
1 answer
4
0 votes
2 answers
5
The number of ways to cut a six sided convex polygon whose vertices are labeled into four triangles using diagonal lines that do not cross is $13$ $14$ $12$ $11$
asked Mar 31 in Graph Theory Lakshman Patel RJIT 295 views
1 vote
1 answer
7
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the plane is equal to: $3$ $4$ $5$ $6$
asked Mar 31 in Graph Theory Lakshman Patel RJIT 155 views
0 votes
2 answers
9
Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph? In adjacency list representation, space is saved for sparse graphs. Deleting a vertex in adjacency list representation is easier than ... matrix representation. Adding a vertex in adjacency list representation is easier than adjacency matrix representation. All of the option.
asked Mar 30 in Graph Theory Lakshman Patel RJIT 581 views
0 votes
1 answer
10
0 votes
1 answer
11
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
asked Mar 30 in Graph Theory Lakshman Patel RJIT 170 views
0 votes
1 answer
12
0 votes
1 answer
13
Which of the following statements is/are TRUE? $S1$:The existence of an Euler circuit implies that an Euler path exists. $S2$:The existence of an Euler path implies that an Euler circuit exists. $S1$ is true. $S2$ is true. $S1$ and $S2$ both are true. $S1$ and $S2$ both are false.
asked Mar 30 in Graph Theory Lakshman Patel RJIT 161 views
0 votes
1 answer
14
0 votes
1 answer
15
0 votes
1 answer
17
0 votes
3 answers
19
0 votes
7 answers
20
...