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 answered questions in Graph Theory

0 votes
1 answer
391
NIELIT 2017 DEC Scientist B - Section B: 23
Let $G$ be a complete undirected graph on $8$ vertices. If vertices of $G$ are labelled, then the number of distinct cycles of length $5$ in $G$ is equal to: $15$ $30$ $56$ $60$
Let $G$ be a complete undirected graph on $8$ vertices. If vertices of $G$ are labelled, then the number of distinct cycles of length $5$ in $G$ is equal to:$15$$30$$56$$...
User Avatar
0 votes
1 answer
392
UGC NET CSE | December 2004 | Part 2 | Question: 4
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)
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)
User Avatar
0 votes
1 answer
393
UGC NET CSE | December 2004 | Part 2 | Question: 23
Weighted graph : Is a bi-directional graph Is directed graph Is graph in which number associated with arc Eliminates table method
Weighted graph :Is a bi-directional graphIs directed graphIs graph in which number associated with arcEliminates table method
User Avatar
7 votes
1 answer
398
UGC NET CSE | June 2019 | Part 2 | Question: 4
Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided by a planar representation of this graph? $6$ $8$ $12$ $20$
Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided by a planar representation of this graph?$6$$8$$12...
User Avatar
1 votes
1 answer
402
ISI2017-PCB-CS-1(b)
Show that if the edge set of the graph $G(V,E)$ with $n$ nodes can be partitioned into $2$ trees, then there is at least one vertex of degree less than $4$ in $G$.
Show that if the edge set of the graph $G(V,E)$ with $n$ nodes can be partitioned into $2$ trees, then there is at least one vertex of degree less than $4$ in $G$.
User Avatar
1 votes
1 answer
405
Allen Career Institute:Graph Theory
If G be connected planar graph with 12 vertices of deg 4 each. In how many regions can this planar graph be partitioned?
If G be connected planar graph with 12 vertices of deg 4 each. In how many regions can this planar graph be partitioned?
User Avatar
0 votes
1 answer
406
doubt
what is the diameter and radius of the complete bipartite graph?
what is the diameter and radius of the complete bipartite graph?
User Avatar
0 votes
1 answer
408
Made Easy Practice Book
The number of labelled subgraph possible for the graph given below are ________.
The number of labelled subgraph possible for the graph given below are ________.
User Avatar
1 votes
1 answer
409
ACE TEST SERIES QUESTION ON Graph Theory
User Avatar
Page: