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
63
UGC NET CSE | June 2012 | Part 2 | Question: 4
The number of colours required to properly colour the vertices of every planer graph is 2 3 4 5
The number of colours required to properly colour the vertices of every planer graph is2345
User Avatar
19 votes
3 answers
64
GATE CSE 2005 | Question: 10
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
4 votes
2 answers
65
No of vertices in Planar graph
If G is a planar graph with 35 regions each of degree 6 the no of vertices are a) 70 b) 80 c) 72 d) 62 What does degree of a region specify here?
If G is a planar graph with 35 regions each of degree 6 the no of vertices area) 70 b) 80 c) 72 d) 62What does degree of a region specify here?
User Avatar
4 votes
1 answer
66
How many strongly connected component are there in the above graph
Consider the following graph (G): How many strongly connected components are there in the above graph?
Consider the following graph (G):How many strongly connected components are there in the above graph?
User Avatar
11 votes
4 answers
67
ISRO2016-5
A given connected graph $\text{G}$ is a Euler Graph if and only if all vertices of $\text{G}$ are of same degree even degree odd degree different degree
A given connected graph $\text{G}$ is a Euler Graph if and only if all vertices of $\text{G}$ are ofsame degree even degreeodd degree ...
User Avatar
9 votes
1 answer
68
ISRO2009-54
A graph in which all nodes are of equal degree, is known as Multigraph Non regular graph Regular graph Complete graph
A graph in which all nodes are of equal degree, is known asMultigraphNon regular graphRegular graphComplete graph
User Avatar
37 votes
7 answers
69
GATE IT 2006 | Question: 11
If all the edge weights of an undirected graph are positive, then any subset of edges that connects all the vertices and has minimum total weight is a Hamiltonian cycle grid hypercube tree
If all the edge weights of an undirected graph are positive, then any subset of edges that connects all the vertices and has minimum total weight is aHamiltonian cyclegri...
User Avatar
39 votes
5 answers
70
GATE CSE 1999 | Question: 1.15
The number of articulation points of the following graph is $0$ $1$ $2$ $3$
The number of articulation points of the following graph is$0$$1$$2$$3$
User Avatar
19 votes
5 answers
71
GATE CSE 2022 | Question: 20
Consider a simple undirected graph of $10$ vertices. If the graph is disconnected, then the maximum number of edges it can have is _______________ .
Consider a simple undirected graph of $10$ vertices. If the graph is disconnected, then the maximum number of edges it can have is _______________ .
User Avatar
7 votes
1 answer
73
UGC NET CSE | June 2019 | Part 2 | Question: 4
Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided by a planar representation of this graph? $6$ $8$ $12$ $20$
Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided by a planar representation of this graph?$6$$8$$12...
User Avatar
15 votes
2 answers
74
GATE CSE 2005 | Question: 47
Which one of the following graphs is NOT planar? G1 G2 G3 G4
Which one of the following graphs is NOT planar? G1G2G3G4
User Avatar
34 votes
4 answers
76
GATE IT 2008 | Question: 3
What is the chromatic number of the following graph? $2$ $3$ $4$ $5$
What is the chromatic number of the following graph? $2$$3$$4$$5$
User Avatar
3 votes
1 answer
77
Max no of edges in disconnected graph
In a simple undirected graph with n vertices what is maximum no of edges that you can have keeping the graph disconnected? A) nC2 -1 B) nC2 C) n-1C2 D n-1C2 - 1 Ans is C) ....Please explain how?
In a simple undirected graph with n vertices what is maximum no of edges that you can have keeping the graph disconnected?A) nC2 -1B) nC2C) n-1C2D n-1C2 - 1Ans is C) .......
User Avatar
13 votes
5 answers
78
GATE CSE 2021 Set 1 | Question: 16
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
User Avatar
0 votes
4 answers
80
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
Page: