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|c|c|c|c|c|c|}\hline \textbf{Year}& \textbf{2026 - 1}& \textbf{2026 - 2}& \textbf{2025 - 1}& \textbf{2025 - 2}& \textbf{2024 - 1}& \textbf{2024 - 2}& \textbf{2023}& \textbf{2022}& \textbf{2021 - 1}& \textbf{2021 - 2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}\\\hline \textbf{1 Mark Count}&0&0&0&0&1&1&0&1&1&0&0&0.4&1\\\hline \textbf{2 Marks Count}&3&1&0&0&1&2&1&3&1&0&0&1.2&3\\\hline \textbf{Total Marks}&6&2&0&0&3&5&2&7&3&0&\bf{0}&\bf{2.8}&\bf{7}\\\hline \end{array}}}$$

Filter

Recent questions in Graph Theory

9 9 votes
1 1 answer
640
640 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Does there exist a simple Eulerian graph on 6 vertices and 7 edges.Enter $1$ for Yes and $0$ for No.
User Avatar
3 3 votes
2 2 answers
342
342 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Does the following graph have a Hamiltonian cycle? Enter $1$ for Yes and $0$ for No.  
User Avatar
3 3 votes
1 1 answer
357
357 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Is the following graph Hamiltonian? Enter $1$ for Yes and $0$ for No.
User Avatar
4 4 votes
4 4 answers
396
396 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Does there exist a graph with the following degree sequence:$$3,3,3,3,5,6,6,6,6,6,6$$Enter $1$ Yes and $0$ for No
User Avatar
3 3 votes
2 2 answers
295
295 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
If $G$ be a simple graph on $n$ vertices with $\Delta(G)=\left\lceil\frac{n}{2}\right\rceil$ and $\delta(G)=\left\lfloor\frac{n}{2}\right\rfloor-1$, then$G$ is connected ...
User Avatar
4 4 votes
3 3 answers
342
342 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is3456
User Avatar
4 4 votes
3 3 answers
300
300 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Which of the following statements is/are TRUE for undirected graphs?P: Number of odd degree vertices is even.Q: Sum of degrees of all vertices is even.P onlyQ onlyBoth P ...
User Avatar
5 5 votes
2 2 answers
240
240 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?$v=e$$v=e+1$$v+1=e$$v=e-1$
User Avatar
2 2 votes
3 3 answers
297
297 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Let $G_1$ and $G_2$ be two disjoint graphs having $p_1$ and $p_2$ vertices and $n_1$, $n_2$ edges respectively. Then the number of edges in $G_1 \vee G_2$ is$n_1+n_2$$n_1...
User Avatar
4 4 votes
4 4 answers
267
267 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
A vertex that is adjacent to exactly one other vertex is called a $\_\_\_\_$ vertex.IsolatedPendantIncidentSimple
User Avatar
3 3 votes
3 3 answers
289
289 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Which of the following will be an upper bound for minimum degree of a graph with 10 vertices.9876
User Avatar
5 5 votes
1 1 answer
194
194 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
A graph is self complementary if it is isomorphic to it's complement.For all self complementary graphs on $n$ vertices, $n$ isA multiple of 4evenoddcongruent to $0 \bmod ...
User Avatar
3 3 votes
1 1 answer
214
214 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
A connected planar graph having 6 vertices, 7 edges contains $\_\_\_\_$ regions.1357
User Avatar
2 2 votes
2 2 answers
267
267 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Which of the following is true for any simple connected graph with more than 2 vertices.No two vertices have same degreeAt least two vertices have same degreeAt least 3 v...
User Avatar
1 1 vote
3 3 answers
245
245 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Total number of regular graphs of degree 2 on 12 vertices.6789
User Avatar
2 2 votes
1 1 answer
156
156 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
What is the regularity of $K_n$.$n$$n-1$01
User Avatar
0 0 votes
1 1 answer
190
190 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
What is the determinant of the adjacency matrix of $C_4$.1-10None of the graph
User Avatar
2 2 votes
1 1 answer
143
143 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
What is the maximum number of edges in a bipartite graph having 12 vertices.24383632
User Avatar
2 2 votes
1 1 answer
153
153 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
What is the number of edges present in complete graph $K_n$ having $n$ vertices.$\frac{n(n+1)}{2}$$\frac{n(n-1)}{2}$$n^2$None of the above
User Avatar
0 0 votes
1 1 answer
187
187 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Which of the following statements for a simple graph is correct.Every trail is a pathEvery path is a trailpathPath and trail have no relation
User Avatar
Page: