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

0 votes
2 answers
1
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
asked Feb 18 in Graph Theory Arjun 227 views
0 votes
3 answers
2
Let $G=(V, E)$ be an undirected unweighted connected graph. The diameter of $G$ is defined as: diam$(G)=\displaystyle \max_{u,v\in V} \{$the length of shortest path between $u$ and $v\}$ Let $M$ be the adjacency matrix of $G$. Define graph $G_2$ on the same set of vertices with adjacency ... diam$(G)/2\rceil<$diam$(G_2)<$ diam$(G)$ diam$(G_2)$ = diam$(G)$ diam$(G)<$ diam$(G_2)\leq 2 $ diam$(G)$
asked Feb 18 in Graph Theory Arjun 221 views
2 votes
1 answer
3
Let G(V,E) be a simple graph. Let G’(V,E’) be a graph obtained from G such that (u,v) is an edge in G’ if (u,v) is not an edge in G. Which of the following is true? At least one of G or G’ are connected. G is necessarily disconnected. Both G and G’ are disconnected. None of the above.
asked Feb 15 in Graph Theory vivek_mishra 100 views
3 votes
3 answers
6
1 vote
1 answer
7
0 votes
2 answers
8
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, 2020 in Graph Theory Lakshman Patel RJIT 447 views
1 vote
1 answer
10
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, 2020 in Graph Theory Lakshman Patel RJIT 228 views
0 votes
1 answer
11
0 votes
2 answers
12
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, 2020 in Graph Theory Lakshman Patel RJIT 1.8k views
0 votes
1 answer
13
0 votes
1 answer
14
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, 2020 in Graph Theory Lakshman Patel RJIT 220 views
0 votes
1 answer
15
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, 2020 in Graph Theory Lakshman Patel RJIT 166 views
0 votes
1 answer
16
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, 2020 in Graph Theory Lakshman Patel RJIT 263 views
0 votes
1 answer
17
0 votes
1 answer
18
0 votes
1 answer
19
0 votes
1 answer
20
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, 2020 in Graph Theory Lakshman Patel RJIT 372 views
...