The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions in Graph Theory
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
Web Page
Connectivity,
Matching,
Coloring.
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
0
votes
0
answers
1
ISI2017PCBB1(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$.
asked
Apr 8
in
Graph Theory
by
akash.dinkar12
Boss
(
39.1k
points)

17
views
isi2017pcbb
engineeringmathematics
discretemathematics
graphtheory
descriptive
0
votes
0
answers
2
selfdoubt
A graph with alternating edges and vertices is called a walk (we can repeat the number of vertices and edges any number of times) . A walk in which no edges are repeated is called a trial. A trial in which no vertices are repeated is called a path. A trial in which only the starting and ending vertices are repeated is called a circuit. Are the definitions correct??
asked
Mar 31
in
Graph Theory
by
Doraemon
(
195
points)

12
views
graph
0
votes
0
answers
3
self doubt
What is the general formula for number of simple graph having n unlabelled vertices ??
asked
Mar 31
in
Graph Theory
by
Doraemon
(
195
points)

31
views
simplegraph
0
votes
1
answer
4
Allen Career Institute: Spanning tree
Let $G$ be a simple undirected complete and weighted graph with vertex set $V = {0, 1, 2, . 99.}$ Weight of the edge $(u, v)$ is $\left  uv \right $ where $0\leq u, v\leq 99$ and $u\neq v$. Weight ... tree is______________ Doubt:Here asking for maximum weight spanning tree. So, there weight will be $0$ to every node. Isnot it? but answer given 7351.
asked
Mar 29
in
Graph Theory
by
srestha
Veteran
(
111k
points)

58
views
discretemathematics
0
votes
1
answer
5
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?
asked
Mar 28
in
Graph Theory
by
srestha
Veteran
(
111k
points)

45
views
discretemathematics
0
votes
0
answers
6
Graph Decomposition
What is Graph Decomposition & is it in the syllabus? If it is then please can anyone share some online resources for it. Thank you.
asked
Mar 17
in
Graph Theory
by
noxevolution
(
103
points)

20
views
graphtheory
0
votes
0
answers
7
Narsingh deo
What is meant by edge disjoint hamiltonian circuits in a graph
asked
Mar 5
in
Graph Theory
by
Winner
(
227
points)

42
views
graphtheory
0
votes
0
answers
8
JEST 2019
A directed graph with n vertices, in which each vertex has exactly 3 outgoing edges. Which one is true? A) All the vertices have indegree = 3 . B) Some vertices will have indegree exactly 3. C)Some vertices have indegree atleast 3. D) Some of the vertices have indegree atmost 3
asked
Feb 18
in
Graph Theory
by
Sayan Bose
Loyal
(
6.2k
points)

61
views
jest
graphtheory
0
votes
0
answers
9
JEST 2019 Descriptive Q2 (8 Marks)
Given a sequence $a_1$, $a_2$ , $a_3$ ... $a_n$ of any different positive integers, exhibit an arrangement of integers between 1 and $n^2$ which has no increasing or decreasing subsequence of length n+1.
asked
Feb 17
in
Graph Theory
by
dan31
Junior
(
869
points)

69
views
jest
2019
discretemathematics
0
votes
0
answers
10
JEST 2019 Descriptive Q1 (8 Marks)
Suppose that G contains a cycle C, and a path of length at least k between some two vertices of C. Show that G contains a cycle of length at least √k.
asked
Feb 17
in
Graph Theory
by
dan31
Junior
(
869
points)

44
views
jest
2019
discretemathematics
0
votes
5
answers
11
GATE201912
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n1)!$ $1$ $\frac{(n1)!}{2}$
asked
Feb 7
in
Graph Theory
by
Arjun
Veteran
(
395k
points)

2.6k
views
gate2019
engineeringmathematics
discretemathematics
graphtheory
graphconnectivity
+1
vote
1
answer
12
GATE201938
Let $G$ be any connected, weighted, undirected graph. $G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight. $G$ has a unique minimum spanning tree, if, for every cut of $G$, there is a unique minimumweight edge crossing the cut. Which of the following statements is/are TRUE? I only II only Both I and II Neither I nor II
asked
Feb 7
in
Graph Theory
by
Arjun
Veteran
(
395k
points)

2.2k
views
gate2019
engineeringmathematics
discretemathematics
graphtheory
graphconnectivity
0
votes
1
answer
13
GATE 2019 8
Q.8 Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to 1. (n1)!/2 2. 1 3.(n1)! 4. n!
asked
Feb 7
in
Graph Theory
by
Ram Swaroop
Active
(
2.6k
points)

315
views
usergate2019
usermod
discretemathematics
graphtheory
0
votes
2
answers
14
GATE2019
What is the total number of different Hamiltonian cycles for the complete graph of n vertices?
asked
Feb 3
in
Graph Theory
by
Atul Sharma 1
(
65
points)

722
views
0
votes
0
answers
15
Abelian group
A quick question Is every multiplication modulo function a Abelian group....Or is it the case that the function should have prime number as modulo
asked
Feb 2
in
Graph Theory
by
Nandkishor3939
Active
(
1.2k
points)

35
views
0
votes
0
answers
16
GeeksforGeeks
Let G be a graph with no isolated vertices, and let M be a maximum matching of G. For each vertex v not saturated by M, choose an edge incident to v. Let T be the set of all the chosen edges, and let L = M ∪ T. Which of the following option is TRUE? A L is always ... G. B L is always a minimum edge cover of G. C Both (A) and (B) D Neither (A) nor (B) Can anyone pls help solving this?
asked
Jan 30
in
Graph Theory
by
Ashish Goyal
(
423
points)

110
views
graphmatching
discretemathematics
graphtheory
testseries
0
votes
0
answers
17
Madeeasy
A graph G is called self complementary iff G is isomorphic to its complement. Let X be a self complementary graph. Which of the following is a viable possibility with regards to the connectivity of X and X', where X' denotes the complement of X, ... answer such questions. So the conclusion is "Every sell complementary graph is cormected". So option (d) is the correct answer.
asked
Jan 29
in
Graph Theory
by
mehul vaidya
Active
(
4.3k
points)

26
views
0
votes
0
answers
18
selfdoubtMEtestseries
we define a new measure ,called GoldIndex(G,C).it takes two arguments as input namely a graph G and set of colors C respectively . the subroutine outputs an integer denoting the number of ways assigning colors to vertices in G such that at least two vertices ... 't know where m i going wrong ,please help me i know their solution is correct but i want to verify my approach
[closed]
asked
Jan 29
in
Graph Theory
by
Prateek Raghuvanshi
Boss
(
10.1k
points)

64
views
0
votes
1
answer
19
#GRAPH THEORY
A simple regular graph n vertices and 24 edges, find all possible values of n.
asked
Jan 29
in
Graph Theory
by
amit166
Junior
(
761
points)

68
views
graphtheory
0
votes
0
answers
20
max weighted MST possible
Let G be a complete undirected graph on 5 vertices 10 edges, with weights being 1, 2, 3, 4, 5, 6, 7, 8, 9, 10. Let X be the value of the maximum possible weight a MST of G can have. Then the value of x will be_____ the answer to this question is given as 11 but there is no procedure given . Please ,can anyone help me out in understanding the procedure
asked
Jan 26
in
Graph Theory
by
Nandkishor3939
Active
(
1.2k
points)

78
views
mst
0
votes
0
answers
21
Made Easy Practice Book
The number of labelled subgraph possible for the graph given below are ________.
asked
Jan 25
in
Graph Theory
by
Shankar Kakde
(
373
points)

36
views
0
votes
0
answers
22
Counting
asked
Jan 25
in
Graph Theory
by
screddy1313
(
477
points)

34
views
discretemathematics
graphtheory
engineeringmathematics
chromaticnumbers
#counting
0
votes
0
answers
23
SelfDoubt
A graph with each vertex has even degree contain Hamiltonian Cycle. True/False plz explain how to ensure Hamiltonian Cycle.
asked
Jan 25
in
Graph Theory
by
Abhisek Tiwari 4
Active
(
4.4k
points)

48
views
0
votes
1
answer
24
Virtual Gate
A complete graph on n vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let G be a complete graph on 10 vertices. Let u, v, w be three distinct vertices in G. How many simple paths are there from u to v going through w?
asked
Jan 24
in
Graph Theory
by
sudharshan
(
289
points)

68
views
discretemathematics
graphtheory
testseries
0
votes
1
answer
25
ACE TEST SERIES QUESTION ON Graph Theory
asked
Jan 24
in
Graph Theory
by
Shankar Kakde
(
373
points)

41
views
0
votes
0
answers
26
SelfDoubt
Checking for Euler Path i.A graph has Euler path if exactly two vertices is of odd degree. if a graph have euler circuit=>all vertices even degree=>euler circuit which already cover euler path. am i correct? i is necessary and sufficient condition? So for ... check either 1.Euler Circuit or 2.Exactly two odd degree then it will have euler path but not euler circuit. is it correct?
[closed]
asked
Jan 20
in
Graph Theory
by
Abhisek Tiwari 4
Active
(
4.4k
points)

32
views
0
votes
1
answer
27
MadeEasy Test Series: Discrete Mathematics  Graph Thoery
The number of labelled subgraphs possible for the graph given below.
asked
Jan 19
in
Graph Theory
by
snaily16
(
263
points)

235
views
madeeasytestseries
discretemathematics
graphtheory
+1
vote
1
answer
28
GATEBOOK2019 Mock Test139
Consider the collection of all un directed graphs with $10$ nodes and $6$ edges. Let M and m, respectively, be the maximum and minimum number of connected components in any graph in the collection. If a graph has no self loops and there is at most one edge between any pair of nodes, which of the ... $M = 10, \: m = 1$ $M = 7, \: m = 4$ $M = 6, \: m = 4$
asked
Jan 19
in
Graph Theory
by
GATEBOOK
Boss
(
17.2k
points)

132
views
gb2019mock1
+1
vote
2
answers
29
GATEBOOK2019 Mock Test140
The number of graphs possible with $5$ vertices and $3$ edges is ____ $10$ $15$ $5$ $120$
asked
Jan 19
in
Graph Theory
by
GATEBOOK
Boss
(
17.2k
points)

257
views
gb2019mock1
0
votes
0
answers
30
Ace Test Series: Graph Theory  Cut Edges
If G is a connected simple graph with 10 vertices in which degree of every vertex is 2 then number of cut edges in G is ?
asked
Jan 19
in
Graph Theory
by
Na462
Loyal
(
8.7k
points)

66
views
graphtheory
acetestseries
Page:
1
2
3
4
5
6
...
28
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
GATE score validity queries.
How to prepare for IISC Interdisciplinary Mathematical Sciences Interview
GO Hardcopy for GATE 2020
How to prepare for BARC interview
IIIT H
All categories
General Aptitude
1.6k
Engineering Mathematics
7.5k
Discrete Mathematics
5.2k
Mathematical Logic
2.1k
Set Theory & Algebra
1.4k
Combinatory
883
Graph Theory
821
Probability
1k
Linear Algebra
694
Calculus
504
Digital Logic
3k
Programming & DS
4.9k
Algorithms
4.3k
Theory of Computation
6k
Compiler Design
2.1k
Operating System
4.2k
Databases
4.2k
CO & Architecture
3.5k
Computer Networks
4.2k
Non GATE
1.4k
Others
1.5k
Admissions
588
Exam Queries
568
Tier 1 Placement Questions
23
Job Queries
72
Projects
18
Follow @csegate
Recent questions in Graph Theory
Recent Blog Comments
10000 to <2000 is really kind of achievement , my...
THey removed it this year... I did not check it,...
even though i am not going for iiit , can you...
I don't think IIITD requires any codechef...
Will apply for IIITB. IIIT D requires a codechef...
50,085
questions
53,209
answers
184,580
comments
70,435
users