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

Most viewed questions in Graph Theory

3 votes
1 answer
152
Kenneth Rosen Edition 6th Exercise 8.2 Question 43 (Page No. 554)
How many subgraphs possible with at least one vertex for the following two graphs ? (labelled vertices) 1. $K_3$ 2. $W_4$ (total 4 vertices)
How many subgraphs possible with at least one vertex for the following two graphs ? (labelled vertices)1. $K_3$2. $W_4$ (total 4 vertices)
User Avatar
0 votes
1 answer
153
Planar Graph
Let G be a simple connected planar graph with 14 vertices and 20 edges. Number of closed regions in planar embedding of the graph is ?
Let G be a simple connected planar graph with 14 vertices and 20 edges. Number of closed regions in planar embedding of the graph is ?
User Avatar
0 votes
0 answers
155
Graph Theory By Narsingh Deo
Where can I find solutions to Narsingh Deo Book for Graph theory any online links and pdf will be helpful ?
Where can I find solutions to Narsingh Deo Book for Graph theory any online links and pdf will be helpful ?
User Avatar
2 votes
2 answers
156
UGC NET CSE | June 2014 | Part 2 | Question: 21
Consider the graph given below as : Which one of the following graph is isomorphic to the above graph ?
Consider the graph given below as :Which one of the following graph is isomorphic to the above graph ?
User Avatar
1 votes
4 answers
158
graph theory
chromatic number of a graph <= ( maxdegree of the graph ) + 1 can somebody explain how ?
chromatic number of a graph <= ( maxdegree of the graph ) + 1 can somebody explain how ?
User Avatar
1 votes
3 answers
159
TIFR CSE 2020 | Part B | Question: 11
Which of the following graphs are bipartite? Only $(1)$ Only $(2)$ Only $(2)$ and $(3)$ None of $(1),(2),(3)$ All of $(1),(2),(3)$
Which of the following graphs are bipartite?Only $(1)$Only $(2)$Only $(2)$ and $(3)$None of $(1),(2),(3)$All of $(1),(2),(3)$
User Avatar
8 votes
3 answers
160
ISRO2009-56
A simple graph ( a graph without parallel edge or loops) with $n$ vertices and $k$ components can have at most $n$ edges $n-k$ edges $(n-k) (n-k+1)$ edges $(n-k) (n-k+1)/2$ edges
A simple graph ( a graph without parallel edge or loops) with $n$ vertices and $k$ components can have at most$n$ edges$n-k$ edges$(n-k) (n-k+1)$ edges$(n-k) (n-k+1)/2$ e...
User Avatar
0 votes
1 answer
161
Strongly connected component
How to find Strongly connected components and weakly connected components in the given graph?
How to find Strongly connected components and weakly connected components in the given graph?
User Avatar
9 votes
4 answers
163
GATE CSE 1992 | Question: 02,viii
A non-planar graph with minimum number of vertices has $9$ edges, $6$ vertices $6$ edges, $4$ vertices $10$ edges, $5$ vertices $9$ edges, $5$ vertices
A non-planar graph with minimum number of vertices has$9$ edges, $6$ vertices$6$ edges, $4$ vertices$10$ edges, $5$ vertices$9$ edges, $5$ vertices
User Avatar
1 votes
1 answer
165
complete lattice and bounded lattice
Prove that every complete lattice is bounded lattice but not vice-versa .
Prove that every complete lattice is bounded lattice but not vice-versa .
User Avatar
2 votes
1 answer
167
Let G be a K-regular bipartite graph with k ≥ 2. Then G has no cut edge
how is this statement correct..can some one give an example?? Let G be a K-regular bipartite graph with k ≥ 2. Then G has no cut edge
how is this statement correct..can some one give an example??Let G be a K-regular bipartite graph with k ≥ 2. Then G has no cut edge
User Avatar
1 votes
4 answers
168
NIELIT 2017 DEC Scientist B - Section B: 52
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is $n(n-1)/2$ $n^{n-2}$ $nx$ $n$
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is$n(n-1)/2$$n^{n-2}$$nx$$n$
User Avatar
0 votes
2 answers
169
kenneth H rosen 7th ed. Ex- 10.3 q-28
What is the sum of the entries in a row of the adjacency matrix for an undirected graph? For a directed graph?
What is the sum of the entries in a row of the adjacencymatrix for an undirected graph? For a directed graph?
User Avatar
Page: