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

0 votes
1 answer
81
What is the number of faces in a connected plane graph having 23 vertices, 30 edges?
What is the number of faces in a connected plane graph having 23 vertices, 30 edges?
What is the number of faces in a connected plane graph having 23 vertices, 30 edges?
User Avatar
19 votes
5 answers
82
GATE CSE 2022 | Question: 20
Consider a simple undirected graph of $10$ vertices. If the graph is disconnected, then the maximum number of edges it can have is _______________ .
Consider a simple undirected graph of $10$ vertices. If the graph is disconnected, then the maximum number of edges it can have is _______________ .
User Avatar
2 votes
1 answer
86
GATE Overflow Test Series | Mock GATE | Test 6 | Question: 13
A simple graph $G$ has degree sequence $(7,7,6,5,5,4,3,3,2)$. What is the degree sequence of $G^{c}$? $(2,3,3,4,5,5,6,7,7)$ $(1,1,3,3,4,5,5,6,6)$ $(1,1,2,3,3,4,5,5,6)$ $(2,2,3,4,4,5,6,6,7)$
A simple graph $G$ has degree sequence $(7,7,6,5,5,4,3,3,2)$. What is the degree sequence of $G^{c}$?$(2,3,3,4,5,5,6,7,7)$$(1,1,3,3,4,5,5,6,6)$$(1,1,2,3,3,4,5,5,6)$$(2,2,...
User Avatar
1 votes
0 answers
89
Made Easy Full length Test
Options Given were---- ADC ABC Both the above None of these According to me the answer should be {A,B,C,D} as this is the largest set and every node is capable to reach every other node.. but the answer given was option C so can anyone plz tell me whats the correct answer?
Options Given were ADCABCBoth the aboveNone of these According to me the answer should be {A,B,C,D} as this is the largest set and every node is capable to reach every o...
User Avatar
0 votes
2 answers
90
self doubt
Both euler path and euler circuit can be present in a graph ?
Both euler path and euler circuit can be present in a graph ?
User Avatar
0 votes
2 answers
91
Self Doubt
Why is the vertex connectivity of a graph always less than or equal to its edge connectivity?
Why is the vertex connectivity of a graph always less than or equal to its edge connectivity?
User Avatar
1 votes
1 answer
92
Testbook Test Series
User Avatar
3 votes
2 answers
97
TIFR CSE 2021 | Part B | Question: 14
Consider the following greedy algorithm for colouring an $n$-vertex undirected graph $G$ with colours $c_{1}, c_{2}, \dots:$ consider the vertices of $G$ ... $m\left ( n, r \right ) = nr$ $m\left ( n, r \right ) = n\binom{r}{2}$
Consider the following greedy algorithm for colouring an $n$-vertex undirected graph $G$ with colours $c_{1}, c_{2}, \dots:$ consider the vertices of $G$ in any sequence ...
User Avatar
13 votes
5 answers
98
GATE CSE 2021 Set 1 | Question: 16
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
In an undirected connected planar graph $G$, there are eight vertices and five faces. The number of edges in $G$ is _________.
User Avatar
3 votes
3 answers
100
JEST2020
Let G(V,E) be a simple graph. Let G’(V,E’) be a graph obtained from G such that (u,v) is an edge in G’ if (u,v) is not an edge in G. Which of the following is true? At least one of G or G’ are connected. G is necessarily disconnected. Both G and G’ are disconnected. None of the above.
Let G(V,E) be a simple graph. Let G’(V,E’) be a graph obtained from G such that (u,v) is an edge in G’ if (u,v) is not an edge in G. Which of the following is true?...
User Avatar
Page: