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

Most viewed questions in Graph Theory

0 votes
1 answer
301
Travelling Salesman problem considering the triangle inequality ,tell the procedure of finding the approximate solution in polynomial time using a suitable example.
0 votes
1 answer
303
Is this lattice distributive?
2 votes
2 answers
304
I just wanted to confirm that if I have a disconnected graph ,then I can call it planar .so for a graph to be planar do I need to check whether it is connected or disconn...
3 votes
3 answers
306
A graph consists of only one vertex,which is isolated ..Is that graphA) a complete graph ???B) a clique???C) connected graph ???Please explain your answer ...
1 votes
0 answers
307
Let G be a connected graph with 7 connected components and each component is a tree. If G has 26 edge then number of vertices in G is?
4 votes
1 answer
308
If a simple graph has 3 component and these component have 4,5,6 vertices ,then maximum number of edge present in graph.(a) 26(b) 76(c)30(d)42
0 votes
1 answer
309
The following lists are the degrees of all the vertices of a graph :$1,2,3,4,5$$3,4,5,6,7$$1, 4, 5, 8, 6$$3,4,5,6$(i) and (ii)(iii) and (iv)(iii) and (ii)(ii) and (iv)
0 votes
2 answers
310
What is the minimal number K such that there exists a proper edge coloring of the complete graph on 8 vertices with K colors?A) 28 B) 8 C) 7 ...
0 votes
4 answers
311
0 votes
1 answer
312
How many different isomorphisms are there from one cycle on n-vertices to another cycle on n-vertices.
0 votes
0 answers
313
How many total Homeomorphically Irreducible Trees are possible with 'n' nodes ?
2 votes
1 answer
314
How many non isomorphic directed simple graph are there with n vertices?
3 votes
4 answers
317
number of subgraph for K3 is
4 votes
1 answer
318
How many undirected graphs are possible with n verticesif graphs are not necessarily connectedif they are necessarily connected
0 votes
2 answers
319
What is the total number of different Hamiltonian cycles for the complete graph of n vertices?
1 votes
4 answers
320
Ans is a) Can anyone plz explain how G1 and G2 are isomorphic?