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

1 votes
1 answer
331
Graph theory
Does this graph have Hamiltonian circuit?
Does this graph have Hamiltonian circuit?
User Avatar
1 votes
1 answer
332
Check whether given graph is planar
G1 and G2 are two graphs as shown— (A) Both 01 and G2 are planar graphs (B) Both G1 and G2 are not planar graphs (C) GI is planar and G2 is not planar graph (D) G1 is not planar and G2 is planar graph
G1 and G2 are two graphs as shown—(A) Both 01 and G2 are planar graphs(B) Both G1 and G2 are not planar graphs(C) GI is planar and G2 is not planar graph(D) G1 is not p...
User Avatar
3 votes
1 answer
333
[Discrete Maths] Graph theory
What is the vertex connectivity and edge connectivity of complete graph? Is it n or n-1?
What is the vertex connectivity and edge connectivity of complete graph?Is it n or n-1?
User Avatar
1 votes
1 answer
334
NIELIT 2016 DEC Scientist B (CS) - Section B: 5
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the plane is equal to: $3$ $4$ $5$ $6$
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the...
User Avatar
5 votes
1 answer
335
GATE Overflow | Mock GATE | Test 1 | Question: 51
... given adjacency matrix representation of a graph containing $7$ nodes (namely A , B, C, D, E, F, G). The Chromatic number of the given graph is?
$\begin{array}{|c|c|c|c|c|c|c|} \hline 0 & 1 & 1 & 0 & 1 & 1 & 0 \\ \hline 1 & 0 & 0 & 1 & 1 & 0 & 1 \\ \hline 1& 0 & 0 & 1 & 1 & 1 & 0 \\ \hline 0 & 1 & 1 & 0 & 1 & 0 & ...
User Avatar
2 votes
2 answers
337
Seld doubt DM
Consider a tree T with n vertices and (n – 1) edges. We define a term called cyclic cardinality of a tree (T) as the number of cycles created when any two vertices of T are joined by an edge. Given a tree with 10 vertices, what is the cyclic cardinality of this tree?
Consider a tree T with n vertices and (n – 1) edges. We define a term called cyclic cardinality of a tree (T) as the number of cycles created when any two vertices of T...
User Avatar
1 votes
1 answer
338
Bipartite Graph
If G is a bipartite planar graph with n vertices, then what is the maximum number of egdes in G. a) 2n-4 b) 3n-2 c) n-2 d) n
If G is a bipartite planar graph with n vertices, then what is the maximum number of egdes in G.a) 2n-4b) 3n-2c) n-2d) n
User Avatar
0 votes
1 answer
339
Kenneth Rosen Edition 6th Exercise 8.4 Question 55 (Page No. 564)
How many non-isomorphic simple graphs are there with five vertices and three edges?
How many non-isomorphic simple graphs are there with five vertices and three edges?
User Avatar
1 votes
1 answer
342
planarity is there in syllabus of graph theory or not?
User Avatar
2 votes
1 answer
343
Properties of Planar graph
Can anyone explain a connected planar graph with n vertices and e edges has e-n+2 regions??
Can anyone explain a connected planar graph with n vertices and e edges has e-n+2 regions??
User Avatar
0 votes
1 answer
344
Which one is right ? Graph theory
1. whenever cut edges exist, cut vertices also exist because at least one vertex of a cut edge is a cut vertex. 2. if a cut vertex exists, then a cut edge may or may not exist.
1. whenever cut edges exist, cut vertices also exist because at least one vertex of a cut edge is a cut vertex.2. if a cut vertex exists, then a cut edge may or may not ...
User Avatar
0 votes
1 answer
345
ACE Bits and bYtes
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
User Avatar
0 votes
0 answers
346
Iso-morphic || Non-Isomorphic Graphs
The Number of Non-Isomorphic simple graphs upto 5 Nodes is _______
The Number of Non-Isomorphic simple graphs upto 5 Nodes is _______
User Avatar
7 votes
3 answers
347
GATE CSE 1988 | Question: 13iii
Are the two digraphs shown in the above figure isomorphic? Justify your answer.
Are the two digraphs shown in the above figure isomorphic? Justify your answer.
User Avatar
1 votes
2 answers
348
UGC NET CSE | December 2007 | Part 2 | Question: 2
The number of edges in a complete graph with $‘n’$ vertices is equal to : $n(n-1)$ $\large\frac{n(n-1)}{2}$ $n^2$ $2n-1$
The number of edges in a complete graph with $‘n’$ vertices is equal to :$n(n-1)$$\large\frac{n(n-1)}{2}$$n^2$$2n-1$
User Avatar
0 votes
1 answer
350
Kenneth Rosen Edition 6th Exercise 8.2 Theorem 1 (Page No. 543)
how to prove that sum of all the vertices in a graph G is equal to twice the number of edges in G. please explain step by step .
how to prove that sum of all the vertices in a graph G is equal to twice the number of edges in G.please explain step by step .
User Avatar
Page: