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

1 votes
1 answer
721
mathematics
In a simple graph G, if degree of each vertex is 3 then graph G is connected. True/False?
In a simple graph G, if degree of each vertex is 3 then graph G is connected.True/False?
User Avatar
2 votes
1 answer
722
mathematics
is this solution is correct.I think either opt(a) or (c) is correct........
is this solution is correct.I think either opt(a) or (c) is correct........
User Avatar
0 votes
1 answer
723
Graph
Is the topic "Planarity" there in GATE 2017 syllabus?
Is the topic "Planarity" there in GATE 2017 syllabus?
User Avatar
1 votes
1 answer
724
Graph Intersection
User Avatar
1 votes
1 answer
728
Graphs
User Avatar
1 votes
2 answers
733
UGC NET CSE | December 2010 | Part 2 | Question: 4
The minimum number of edges in a connected graph with $‘n’$ vertices is equal to $n (n – 1)$ $\frac{n(n-1)}{2}$ $n^{2}$ $n – 1$
The minimum number of edges in a connected graph with $‘n’$ vertices is equal to$n (n – 1)$ $\frac{n(n-1)}{2}$$n^{2}$$n – 1$
User Avatar
3 votes
1 answer
734
UGC NET CSE | December 2010 | Part 2 | Question: 2
An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are All of even degree All of odd degree Of any degree Even in number
An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices areAll of even degreeAll of odd degreeOf any degreeEven in number
User Avatar
1 votes
0 answers
736
#Narsingh_Deo Chapter-2 problem 2-29
Show that in a dancing ring of n children it is always possible to arrange the children so that everyone has a friend at each side if every child enjoys friendship with at least half the children.
Show that in a dancing ring of n children it is always possible to arrange the children so that everyone has a friend at each side if every child enjoys friendship with a...
User Avatar
3 votes
1 answer
737
Narsingh Deo , Chapter 2, problem 2-18
If the intersection of two path is a disconnected graph, Show that the union of the two path has at least one circuit.
If the intersection of two path is a disconnected graph, Show that the union of the two path has at least one circuit.
User Avatar
2 votes
2 answers
738
Graph
consider G is an undirected simple graph in which
consider G is an undirected simple graph in which
User Avatar
2 votes
1 answer
739
UGC NET CSE | December 2011 | Part 2 | Question: 15
McCabe’s cyclomatic metric $V(G)$ of a graph $G$ with $n$ vertices, $e$ edges and $p$ connected component is $e$ $n$ $e – n + p$ $e – n + 2p$
McCabe’s cyclomatic metric $V(G)$ of a graph $G$ with $n$ vertices, $e$ edges and $p$ connected component is$e$ $n$ $e – n + p$ $e – n + 2p$
User Avatar
3 votes
1 answer
740
UGC NET CSE | December 2011 | Part 2 | Question: 5
Maximum number of edges in a n -Node undirected graph without self loop is $n^{2}$ $n(n – 1)$ $n(n + 1)$ $\frac{n(n - 1)}{2}$
Maximum number of edges in a n -Node undirected graph without self loop is$n^{2}$$n(n – 1)$ $n(n + 1)$$\frac{n(n - 1)}{2}$
User Avatar
Page: