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

0 votes
1 answer
571
Graph theory.
Matching and edge coloring are same ?
Matching and edge coloring are same ?
User Avatar
0 votes
0 answers
572
SELF DOUBT
Explain isomorphism in context of groups with example
Explain isomorphism in context of groups with example
User Avatar
2 votes
1 answer
573
Min Cut set
User Avatar
2 votes
0 answers
574
Directed graph
how to calculate number of directed graphs possible having n vertices?
how to calculate number of directed graphs possible having n vertices?
User Avatar
1 votes
1 answer
575
graph theory
For complete bipartite graph k2,3 , what is the edge connectivity ?
For complete bipartite graph k2,3 , what is the edge connectivity ?
User Avatar
1 votes
1 answer
576
please solve this Q
Q . The maximum number of edges in an undirected graph (simple) with 52 vertices and 3 components are
Q . The maximum number of edges in an undirected graph (simple) with 52 vertices and 3 components are
User Avatar
2 votes
0 answers
578
counting
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to 15 30 90 360
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to153090360
User Avatar
1 votes
1 answer
579
planarity is there in syllabus of graph theory or not?
User Avatar
3 votes
1 answer
580
Please suggest material for graph theory .
Please suggest material for graph theory .
Please suggest material for graph theory .
User Avatar
2 votes
3 answers
581
Kenneth Rosen Edition 7 Exercise 10.8 Question 23 (Page No. 734)
Find the edge chromatic numbers of a) Cn, where n ≥ 3. (Cycle with n vertices) b) Wn, where n ≥ 3 (Wheel with n vertices) c)Complete graph with n vertices.
Find the edge chromatic numbers ofa) Cn, where n ≥ 3. (Cycle with n vertices)b) Wn, where n ≥ 3 (Wheel with n vertices)c)Complete graph with n vertices.
User Avatar
3 votes
0 answers
586
Minimum No. of vertices required
Prove the following for graph $G$. When length of the shortest cycle in a graph is $k \geq 3$ and the minimum degree of the graph is $d$, then $G$ ... $k$.
Prove the following for graph $G$.When length of the shortest cycle in a graph is $k \geq 3$ and the minimum degree of the graph is $d$, then $G$ has minimum $\begin{alig...
User Avatar
0 votes
1 answer
587
rosen graph theory
find the values (k tuple coloring ) 1)$X_{2}(K_{3}) 2. X_{3}(K_{5})$
find the values (k tuple coloring )1)$X_{2}(K_{3}) 2. X_{3}(K_{5})$
User Avatar
0 votes
1 answer
588
Self - Doubt
What is clique?
What is clique?
User Avatar
1 votes
1 answer
589
General Math
Why is $n \leq 2^{h+1} - 1$ equivalent to $h \geq \log_2{\frac{n+1}{2}}$ ? This is applicable to Binary Trees
Why is $n \leq 2^{h+1} - 1$ equivalent to $h \geq \log_2{\frac{n+1}{2}}$ ? This is applicable to Binary Trees
User Avatar
3 votes
3 answers
590
[Discrete Maths] Graph Theory Rosen,Chromatic number
What are the chromatic number of following graphs? Answer is 6 and 4 respectively.But i am getting 3 for both. Please someone confirm this?
What are the chromatic number of following graphs?Answer is 6 and 4 respectively.But i am getting 3 for both.Please someone confirm this?
User Avatar
Page: