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
91
UGC NET CSE | June 2014 | Part 2 | Question: 23
Consider a complete bipartite graph $k_{m,n}$. For which values of $m$ and $n$ does this, complete graph have a Hamilton circuit $m = 3, n = 2$ $m = 2, n = 3$ $m = n > 2$ $m = n > 3$
Consider a complete bipartite graph $k_{m,n}$. For which values of $m$ and $n$ does this, complete graph have a Hamilton circuit $m = 3, n = 2$$m = 2, n = 3$ $m = n 2$$m...
User Avatar
25 votes
8 answers
92
GATE IT 2004 | Question: 5
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices? $n-1$ $n$ $n+1$ $2n-1$
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices?$n-1$$n$$n+1$$2n-1$
User Avatar
17 votes
2 answers
93
GATE CSE 2011 | Question: 17
K4 and Q3 are graphs with the following structures. Which one of the following statements is TRUE in relation to these graphs? K4 is a planar while Q3 is not Both K4 and Q3 are planar Q3 is planar while K4 is not Neither K4 nor Q3 is planar
K4 and Q3 are graphs with the following structures.Which one of the following statements is TRUE in relation to these graphs?K4 is a planar while Q3 is notBoth K4 and Q3 ...
User Avatar
33 votes
3 answers
97
GATE CSE 1992 | Question: 03,iii
How many edges can there be in a forest with $p$ components having $n$ vertices in all?
How many edges can there be in a forest with $p$ components having $n$ vertices in all?
User Avatar
19 votes
3 answers
100
GATE CSE 1995 | Question: 24
Prove that in finite graph, the number of vertices of odd degree is always even.
Prove that in finite graph, the number of vertices of odd degree is always even.
User Avatar
0 votes
0 answers
101
graph theory
A simple non directed graph contains 21 edges, 3 vertices of degree 4 and the other vertices are of degree 2. then the number of vertices in the graph is ?
A simple non directed graph contains 21 edges, 3 vertices of degree 4 and the other vertices are of degree 2. then the number of vertices in the graph is ?
User Avatar
1 votes
3 answers
102
No of spanning Trees
Let $K_n$ denote the complete undirected graph with $n$ vertices where n is an even number. Find the maximum number of spanning trees of $K_n$ that can be formed in such a way that no two of these spanning trees have a common edge.
Let $K_n$ denote the complete undirected graph with $n$ vertices where n is an even number. Find the maximum number of spanning trees of $K_n$ that can be formed in such ...
User Avatar
10 votes
1 answer
104
GATE CSE 1992 | Question: 01,x
Maximum number of edges in a planar graph with $n$ vertices is _____
Maximum number of edges in a planar graph with $n$ vertices is _____
User Avatar
6 votes
2 answers
106
no of different rooted labeled trees with n vertices ?
User Avatar
7 votes
3 answers
108
ISRO2009-55
In a graph $\text{G}$ there is one and only one path between every pair of vertices then $\text{G}$ is a Path Walk Tree Circuit
In a graph $\text{G}$ there is one and only one path between every pair of vertices then $\text{G}$ is aPathWalkTreeCircuit
User Avatar
Page: