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

3 votes
3 answers
2
1 vote
1 answer
3
If a planner graph, having $25$ vertices divides the plane into $17$ different regions. Then how many edges are used to connect the vertices in this graph. $20$ $30$ $40$ $50$
asked Mar 31 in Graph Theory Lakshman Patel RJIT 59 views
0 votes
2 answers
4
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 69 views
0 votes
1 answer
5
0 votes
1 answer
6
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 84 views
0 votes
1 answer
7
0 votes
2 answers
8
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 108 views
0 votes
1 answer
9
0 votes
1 answer
10
What are the appropriate data structures for graph traversal using Breadth First Search(BFS) and Depth First Search(DFS) algorithms? Stack for BFS and Queue for DFS Queue for BFS and Stack for DFS Stack for BFS and Stack for DFS Queue for BFS and Queue for DFS
asked Mar 30 in Graph Theory Lakshman Patel RJIT 73 views
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 83 views
0 votes
1 answer
12
Considering the following graph, which one of the following set of edged represents all the bridges of the given graph? $(a,b), (e,f)$ $(a,b), (a,c)$ $(c,d), (d,h)$ $(a,b)$
asked Mar 30 in Graph Theory Lakshman Patel RJIT 64 views
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 70 views
0 votes
1 answer
14
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$
asked Mar 30 in Graph Theory Lakshman Patel RJIT 53 views
0 votes
1 answer
15
0 votes
1 answer
16
0 votes
1 answer
17
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
asked Mar 30 in Graph Theory Lakshman Patel RJIT 87 views
0 votes
3 answers
18
0 votes
3 answers
19
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.
asked Mar 30 in Graph Theory Lakshman Patel RJIT 237 views
0 votes
7 answers
20
...