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{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} &1&1&0& 1&1&0&0&0.83&1
\\\hline\textbf{2 Marks Count} &1&2&1& 3 &1&0&0&1.33&3
\\\hline\textbf{Total Marks} & 3&5&2&7 &3&0&\bf{0}&\bf{3.33}&\bf{7}\\\hline
\end{array}}}$$

Recent questions in Graph Theory

#441
735
views
1 answers
0 votes
Suppose G is a connected planar simple graph having V vertices, E edges . Let R denote number of bounded regions, in a planar representation of G. Which of the following ...
#442
627
views
2 answers
0 votes
#443
333
views
0 answers
0 votes
#444
982
views
1 answers
1 votes
Number of multi-graphs possible with 4 vertices and at most 2 edges between each pair of vertices is ________________
#445
611
views
0 answers
0 votes
Let G be a planar graph with 7 vertices, 10 edges and 3 components then the number of regions are :a)24b)37c)7d)10Answer given : 7How to solve this ? Is there any formula...
#446
342
views
0 answers
1 votes
#447
376
views
0 answers
0 votes
Doubt in 2nd and 3rd ....
#448
406
views
0 answers
0 votes
Consider the following graph:Which of the following will represents the chromatic number of the graph?I think ans has to be 3 but given as 4
#449
690
views
0 answers
1 votes
#450
848
views
2 answers
2 votes
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
#451
399
views
0 answers
1 votes
I think answer is option A. But given option B.
#452
681
views
1 answers
0 votes
#453
655
views
1 answers
0 votes
Graph can be a tree (Will it not give the maximum no. of vertices??)
#454
327
views
1 answers
1 votes
#455
823
views
2 answers
5 votes
#456
849
views
0 answers
0 votes
The edge set of every closed trail can be partitioned into edge sets of cyclesTrue / False (Explain)
#457
605
views
1 answers
0 votes
I am not convinced by this. Please explain or please tell me the source from where I can clear this out.
#458
1.8k
views
0 answers
0 votes
Consider complete graphs K5 and K6 . Let X5 and X6 are number of perfect matching of K5 and K6 respectively. Then X5 + X6 = ________.
#459
254
views
0 answers
0 votes
Let a graph G(V,ϵ) has 2048 vertices and ‘G’ is a multi-graph. Then the maximum number of edges in the Graph G(V,ϵ) such that vertices have even number of edges.Gra...
#460
159
views
0 answers
0 votes
A chain letter starts when a person sends a letter to five others.Each person who receives the letter either sends it to five other people who have never received it o...