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

Highest voted questions in Graph Theory

1 votes
1 answer
451
self doubt
in a rooted tree if we are asked to find the level of root then it should be 0 or 1 or question depending ??
in a rooted tree if we are asked to find the level of root then it should be 0 or 1 or question depending ??
User Avatar
1 votes
2 answers
454
Connectivity(4-20) Narsingh Deo
Is every regular graph of degree d(d$\geq$3) non-separable?If not, give a simple regular graph of degree 3 that is separable.
Is every regular graph of degree d(d$\geq$3) non-separable?If not, give a simple regular graph of degree 3 that is separable.
User Avatar
1 votes
2 answers
455
Graph Theory #self doubt
Can both euler path and euler circuit exist in same graph. Can both Hamiltonian path and Hamiltonian circuit exist in same graph.
Can both euler path and euler circuit exist in same graph.Can both Hamiltonian path and Hamiltonian circuit exist in same graph.
User Avatar
1 votes
2 answers
456
IISc CDS (MTech-R)
Number of distinct simple graphs possible, given 8 vertices and not considering self loops?
Number of distinct simple graphs possible, given 8 vertices and not considering self loops?
User Avatar
1 votes
1 answer
457
PGEE 2018
Consider Undirected Graph G having vertex V {A,B,C,D,E} and edge pair as E {AB BD BE AC CE CD} A) Given graph is disconnected B) Given graph is complete C) Given graph has vertex connectivity 2 D) Given graph has edge connectivity 1
Consider Undirected Graph Ghaving vertex V {A,B,C,D,E}and edge pair as E {AB BD BE AC CE CD}A) Given graph is disconnectedB) Given graph is completeC) Given graph has ver...
User Avatar
1 votes
1 answer
458
Narsingh Deo Problem 2-28
User Avatar
1 votes
1 answer
460
Graph Theory
Let G be a simple graph in which every vertex has degree 3. Prove that G decomposes into claws iff G is bipartite.
Let G be a simple graph in which every vertex has degree 3. Prove that G decomposes into claws iff G is bipartite.
User Avatar
1 votes
1 answer
461
Graph Book
The maximum number of edges in a n-node undirected graph WITH self-loops is?
The maximum number of edges in a n-node undirected graph WITH self-loops is?
User Avatar
1 votes
2 answers
464
Graph Theory
Can someone solve this? Also please attempt this question on Algorithms time complexity if interested :) https://gateoverflow.in/210836/algorithms-time-complexity
Can someone solve this?Also please attempt this question on Algorithms time complexity if interested :)https://gateoverflow.in/210836/algorithms-time-complexity
User Avatar
1 votes
1 answer
466
Graph theory
As a triangle graph is $2 -$ connected, thus for a given triangle graph, $r= 2( r_1\text{ and } r_2)$ , $k=2, e = 3, v=3$, but it still doesn't satisfy the equation, Can someone tell me where did I go wrong? Thanks
As a triangle graph is $2 -$ connected, thus for a given triangle graph, $r= 2( r_1\text{ and } r_2)$ , $k=2, e = 3, v=3$, but it still doesn't satisfy the equation, Can ...
User Avatar
1 votes
0 answers
467
[2016]IITK interview question
1. Prove/Disprove: a) If a graph has k-independent components, it it n-k+1 colorable b) converse of (a) c) If a graph is not n-1 colorable, it's a clique
1. Prove/Disprove:a) If a graph has k-independent components, it it n-k+1 colorableb) converse of (a)c) If a graph is not n-1 colorable, it's a clique
User Avatar
1 votes
0 answers
469
Test series
my doubt is why 14 has been subtracted ??
my doubt is why 14 has been subtracted ??
User Avatar
1 votes
0 answers
470
MadeEasy Test Series: Graph Theory - Vertex Cover
Vertex cover = Total vertex - Maximum independent set vertex cover = 8 - 3 = 5. In given answer Covering number is given as 4. I think it is given wrong please verify. Thank you.
Vertex cover = Total vertex - Maximum independent setvertex cover = 8 - 3 = 5.In given answer Covering number is given as 4. I think it is given wrong please verify. Than...
User Avatar
Page: