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

1 votes
3 answers
881
Find maximum edges in Graph
User Avatar
0 votes
1 answer
882
check the question
k5 : the regular graph of degree 4 L(k5) : the line graph of graph k5 1. the line graph L(k5) is a regular graph of degree_______ and edges ________
k5 : the regular graph of degree 4L(k5) : the line graph of graph k51. the line graph L(k5) is a regular graph of degree_______ and edges ________
User Avatar
0 votes
1 answer
883
Question on graph theory
Please explain how did they get that equation in E and V.
Please explain how did they get that equation in E and V.
User Avatar
1 votes
1 answer
884
What is Maximal Independent Set (MIS) ? How to calulate size of it ?
User Avatar
4 votes
1 answer
886
How many strongly connected component are there in the above graph
Consider the following graph (G): How many strongly connected components are there in the above graph?
Consider the following graph (G):How many strongly connected components are there in the above graph?
User Avatar
4 votes
1 answer
887
Graph theory
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
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
User Avatar
2 votes
1 answer
888
Graph theory
How many non isomorphic directed simple graph are there with n vertices?
How many non isomorphic directed simple graph are there with n vertices?
User Avatar
0 votes
1 answer
889
graph theory
How many non-isomorphic simple graph are there with 5 vertices and 3 edges?how to approach this qus....
How many non-isomorphic simple graph are there with 5 vertices and 3 edges?how to approach this qus....
User Avatar
0 votes
2 answers
891
graph theory
User Avatar
3 votes
3 answers
892
Number of nodes of distinct degree
In a simple connected undirected graph with n nodes(where n≧2), The maximum number of nodes with distinct degrees is n-1 n-2 n-3 2
In a simple connected undirected graph with n nodes(where n≧2), The maximum number of nodes with distinct degrees is n-1n-2n-32
User Avatar
2 votes
0 answers
895
recurrence relation
for the recurrence relation an=6an-1-9an-2 + F n , what will be the particular solution if case 1; F n = 3n 5n+1 case 2; F n = 2n 5n+1
for the recurrence relation an=6an-1-9an-2 + F n , what will be the particular solutionif case 1; F n = 3n 5n+1 case 2; F n = 2n 5n+1
User Avatar
5 votes
2 answers
896
recurrence relation
the solution to the recurrence relation T(n)= T(n-1) +n, T(0)=2 is.. what is approach to solve it??
the solution to the recurrence relation T(n)= T(n-1) +n, T(0)=2 is..what is approach to solve it??
User Avatar
4 votes
1 answer
897
maximum no of vertices explain plz
Q1. Assume that G is a simple graph of 20 edges, 6 vertices of degree 4 and other nodes have degrees more than 5, then the maximum no of vertices of G is______ Q2. all thread must wait whenever any critical section is occupied----how this is false?
Q1. Assume that G is a simple graph of 20 edges, 6 vertices of degree 4 and other nodes have degrees more than 5, then the maximum no of vertices of G is______Q2. all th...
User Avatar
2 votes
1 answer
899
Non planarity
Kuratowski's second graph is not planar then why it dont contradict for following inequality for checking planarity : e<=3n-6 =>(e=9)<=3*(n=6)-6 =>9<=12 , which is true
Kuratowski's second graph is not planar then why it dont contradict for following inequality for checking planarity :e<=3n-6=>(e=9)<=3*(n=6)-6=>9<=12 , which is true
User Avatar
6 votes
3 answers
900
How to find no of paths of length 2 in the below graph ?
Determine the number of paths of length $2$ in the following graph I couldn't get this logic .
Determine the number of paths of length $2$ in the following graphI couldn't get this logic .
User Avatar
Page: