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

Hot questions in Graph Theory

1 votes
1 answer
301
DRDO-2008
Adacency list is preferred over adjacency matrix when the graph is? A) planar B) Dense C) Clique D) none of these
Adacency list is preferred over adjacency matrix when the graph is?A) planarB) DenseC) CliqueD) none of these
User Avatar
0 votes
1 answer
304
Made Easy Practice Book
The number of labelled subgraph possible for the graph given below are ________.
The number of labelled subgraph possible for the graph given below are ________.
User Avatar
3 votes
2 answers
305
UGC NET CSE | June 2019 | Part 2 | Question: 5
For which values of $m$ and $n$ does the complete bipartite graph $k_{m,n}$ have a Hamiltonian circuit ? $m\neq n,\ \ m,n \geq 2$ $m\neq n,\ \ m,n \geq 3$ $m=n,\ \ m,n \geq 2$ $m= n,\ \ m,n \geq 3$
For which values of $m$ and $n$ does the complete bipartite graph $k_{m,n}$ have a Hamiltonian circuit ?$m\neq n,\ \ m,n \geq 2$$m\neq n,\ \ m,n \geq 3$$m=n,\ \ m,n \geq ...
User Avatar
29 votes
4 answers
311
GATE CSE 2012 | Question: 26
Which of the following graphs is isomorphic to
Which of the following graphs is isomorphic to
User Avatar
0 votes
2 answers
313
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
2 answers
314
GateForum Question Bank :Graph Theory
What is the probability that there is an edge in an undirected random graph having 8 vertices? 1 1/8
What is the probability that there is an edge in an undirected random graph having 8 vertices?1 1/8
User Avatar
2 votes
3 answers
316
N cube Graph
In N-cube graph we have no. of vertices = $2^N$ and no. of edges = $N*2^{N-1}$ Can anyone explain how we get this no. of edges?
In N-cube graph we have no. of vertices = $2^N$ and no. of edges = $N*2^{N-1}$Can anyone explain how we get this no. of edges?
User Avatar
Page: