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
151
ISI2017-PCB-CS-1(b)
Show that if the edge set of the graph $G(V,E)$ with $n$ nodes can be partitioned into $2$ trees, then there is at least one vertex of degree less than $4$ in $G$.
Show that if the edge set of the graph $G(V,E)$ with $n$ nodes can be partitioned into $2$ trees, then there is at least one vertex of degree less than $4$ in $G$.
User Avatar
0 votes
2 answers
153
self doubt
What is the general formula for number of simple graph having n unlabelled vertices ??
What is the general formula for number of simple graph having n unlabelled vertices ??
User Avatar
1 votes
1 answer
155
Allen Career Institute:Graph Theory
If G be connected planar graph with 12 vertices of deg 4 each. In how many regions can this planar graph be partitioned?
If G be connected planar graph with 12 vertices of deg 4 each. In how many regions can this planar graph be partitioned?
User Avatar
0 votes
0 answers
156
Graph Decomposition
What is Graph Decomposition & is it in the syllabus? If it is then please can anyone share some online resources for it. Thank you.
What is Graph Decomposition & is it in the syllabus?If it is then please can anyone share some online resources for it. Thank you.
User Avatar
0 votes
0 answers
157
Narsingh deo
What is meant by edge disjoint hamiltonian circuits in a graph
What is meant by edge disjoint hamiltonian circuits in a graph
User Avatar
2 votes
0 answers
158
JEST 2019
A directed graph with n vertices, in which each vertex has exactly 3 outgoing edges. Which one is true? A) All the vertices have indegree = 3 . B) Some vertices will have indegree exactly 3. C)Some vertices have indegree atleast 3. D) Some of the vertices have indegree atmost 3
A directed graph with n vertices, in which each vertex has exactly 3 outgoing edges. Which one is true?A) All the vertices have indegree = 3 .B) Some vertices will have i...
User Avatar
0 votes
0 answers
159
JEST 2019 Descriptive Q2 (8 Marks)
Given a sequence $a_1$, $a_2$ , $a_3$ ... $a_n$ of any different positive integers, exhibit an arrangement of integers between 1 and $n^2$ which has no increasing or decreasing subsequence of length n+1.
Given a sequence $a_1$, $a_2$ , $a_3$ ... $a_n$ of any different positive integers, exhibit an arrangement of integers between 1 and $n^2$ which has no increasing or decr...
User Avatar
1 votes
0 answers
160
JEST 2019 Descriptive Q1 (8 Marks)
Suppose that G contains a cycle C, and a path of length at least k between some two vertices of C. Show that G contains a cycle of length at least √k.
Suppose that G contains a cycle C, and a path of length at least k between some twovertices of C. Show that G contains a cycle of length at least √k.
User Avatar
33 votes
14 answers
161
GATE CSE 2019 | Question: 12
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n-1)!$ $1$ $\frac{(n-1)!}{2}$
Let $G$ be an undirected complete graph on $n$ vertices, where $n 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to$n!$$(n-1)!$$1$$\frac{(n-1)!}{2}...
User Avatar
0 votes
2 answers
163
GATE2019
What is the total number of different Hamiltonian cycles for the complete graph of n vertices?
What is the total number of different Hamiltonian cycles for the complete graph of n vertices?
User Avatar
0 votes
0 answers
164
Abelian group
A quick question Is every multiplication modulo function a Abelian group....Or is it the case that the function should have prime number as modulo
A quick question Is every multiplication modulo function a Abelian group....Or is it the case that the function should have prime number as modulo
User Avatar
0 votes
2 answers
168
#GRAPH THEORY
A simple regular graph n vertices and 24 edges, find all possible values of n.
A simple regular graph n vertices and 24 edges, find all possible values of n.
User Avatar
0 votes
1 answer
169
doubt
what is the diameter and radius of the complete bipartite graph?
what is the diameter and radius of the complete bipartite graph?
User Avatar
Page: