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}}}$$

Recent questions in Graph Theory

0 votes
1 answer
391
Consider the following statements:S1: Every cyclic group is Abelian group.S2: Every Abelian group is cyclic group.S3: Cyclic group of order 10 have 4 generators.Which of ...
0 votes
1 answer
392
Plz explain ??
1 votes
0 answers
393
my doubt is why 14 has been subtracted ??
1 votes
0 answers
394
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...
2 votes
0 answers
397
how they are drawing DAG.Can someone explain?
1 votes
0 answers
399
A graph G=(V,E)satisfies |E|≤3|v|-6, the min degree of G is defined asmin⁡{degree(v) } v∈V. Therefore min degree of ‘G’ can be ?
2 votes
2 answers
400
I am getting 16X15/2=120 given is 105
1 votes
1 answer
401
7 votes
1 answer
402
1 votes
0 answers
403
1 votes
0 answers
404
Since , matching no. + edge cover = no. of vertices= 1 +5 =6Did I do right or wrong ?
1 votes
0 answers
405
The binary operation defined on a,b∈z such that a*b= min⁡(a,b)then (A,*) is 1.Monoid 2.Algebra structure 3.Group 4.Semi group
2 votes
0 answers
406
If we backtrack in DFS ,then doesn't statement 1 becomes true ?
7 votes
1 answer
407
Find the no of strongly connected components for the below graph.$5$$4$$9$$2$
8 votes
2 answers
409
1 votes
1 answer
410
someone post complete solution