The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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 tagged graphconnectivity
+1
vote
0
answers
1
Difference between DAG and Multistage graph
I have trouble understanding the difference between DAG and Multistage graph. I know what each of them is But I think that a multistage graph is also a DAG. Are multistage graphs a special kind of DAG?
asked
Apr 28
in
Graph Theory
by
gmrishikumar
Active
(
1.9k
points)

63
views
graphtheory
graphalgorithms
graphconnectivity
multistagegraph
directedacyclicgraph
dag
+5
votes
8
answers
2
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
(
418k
points)

3.1k
views
gate2019
engineeringmathematics
discretemathematics
graphtheory
graphconnectivity
+3
votes
2
answers
3
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
(
418k
points)

2.6k
views
gate2019
engineeringmathematics
discretemathematics
graphtheory
graphconnectivity
+1
vote
1
answer
4
MadeEasy Full Length Test 2019: Graph Theory  Vertex Connectivity
The Vertex Connectivity of Graph is : 1 2 3 None
asked
Jan 16
in
Graph Theory
by
Na462
Loyal
(
6.7k
points)

114
views
graphtheory
graphconnectivity
madeeasytestseries2019
madeeasytestseries
0
votes
1
answer
5
Zeal Test Series 2019: Graph Theory  Graph Connectivity
asked
Dec 22, 2018
in
Graph Theory
by
Prince Sindhiya
Loyal
(
5.5k
points)

100
views
zeal
graphtheory
graphconnectivity
zeal2019
0
votes
1
answer
6
TIFR2019B3
A graph is $d$ – regular if every vertex has degree $d$. For a $d$ – regular graph on $n$ vertices, which of the following must be TRUE? $d$ divides $n$ Both $d$ and $n$ are even Both $d$ and $n$ are odd At least one of $d$ and $n$ is odd At least one of $d$ and $n$ is even
asked
Dec 18, 2018
in
Graph Theory
by
Arjun
Veteran
(
418k
points)

169
views
tifr2019
graphconnectivity
graphtheory
+1
vote
1
answer
7
TIFR2019B12
Let $G=(V,E)$ be a directed graph with $n(\geq 2)$ vertices, including a special vertex $r$. Each edge $e \in E$ has a strictly positive edge weight $w(e)$. An arborescence in $G$ rooted at $r$ is a subgraph $H$ of $G$ in which every ... $w^*$ is less than the weight of the minimum weight directed Hamiltonian cycle in $G$, when $G$ has a directed Hamiltonian cycle
asked
Dec 18, 2018
in
Graph Theory
by
Arjun
Veteran
(
418k
points)

264
views
tifr2019
graphconnectivity
graphtheory
difficult
+1
vote
1
answer
8
TIFR2019B15
Consider directed graphs on $n$ labelled vertices $\{1,2, \dots ,n\}$, where each vertex has exactly one edge coming in and exactly coming in and exactly one edge going out. We allow selfloops. How many graphs have exactly two cycles ? $\sum_{k=1}^{n1} k!(nk)!$ ... $n!\bigg[\sum_{k=1}^{n1} \frac{1}{k}\bigg]$ $\frac{n!(n1)}{2}$ None of the above
asked
Dec 18, 2018
in
Graph Theory
by
Arjun
Veteran
(
418k
points)

269
views
tifr2019
graphconnectivity
graphtheory
+3
votes
0
answers
9
Zeal Test Series 2019: Graph Theory  Graph Connectivity
i didn't read the concept related to strongly connected components please it describe it for this question
asked
Nov 11, 2018
in
Graph Theory
by
Prince Sindhiya
Loyal
(
5.5k
points)

119
views
zeal
graphtheory
discretemathematics
graphconnectivity
zeal2019
+1
vote
2
answers
10
Graph Connectivity
Consider the given statements S1: In a simple graph G with 6 vertices, if degree of each vertex is 2, then Euler circuit exists in G. S2:In a simple graph G, if degree of each vertex is 3 then the graph G is connected. Which of the following is/are true?
asked
Nov 6, 2018
in
Graph Theory
by
dan31
Junior
(
853
points)

208
views
graphtheory
eulergraph
graphconnectivity
+1
vote
0
answers
11
Graph connectivity
Let G be a connected graph with 7 connected components and each component is a tree. If G has 26 edge then number of vertices in G is?
asked
Nov 6, 2018
in
Graph Theory
by
dan31
Junior
(
853
points)

209
views
graphtheory
graphconnectivity
0
votes
0
answers
12
Gateforum Test Series: Graph Theory  Graph connectivity
asked
Oct 29, 2018
in
Graph Theory
by
Gupta731
Active
(
4.6k
points)

86
views
discretemathematics
graphtheory
gateforumtestseries
graphconnectivity
+2
votes
3
answers
13
GATEBOOK2019DS23
A quinpartite graph is a graph whose vertices can be partitioned into five groups such that no two vertices in same group are connected via some edge. The maximum number of edges in a quinpartite graph with $10$ vertices, where cardinalities of those five sets are given as $\{2,3,2,1,2\},$ is: $16$ $20$ $26$ $39$
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

199
views
gb2019ds2
graphtheory
graphconnectivity
+2
votes
1
answer
14
GATEBOOK2019DS218
Consider following statements about Cycle graph, Complete Bipartite graph and Complete graph. Cycle graph $C_n$ is subgraph of a complete graph $K_n$. $K_{n,n}$ is a subgraph of $K_m$ if $m\le 2n$. $C_n$ a subgraph of $K_{n,n}$ if $n$ is even. Which of the above statements is/are TRUE? (i) and (iii) only (ii) and (iii) only (i) only (iii) only
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

117
views
gb2019ds2
graphconnectivity
+1
vote
0
answers
15
UGCNET CS 2017
An undirected graph G (V, E) contains n (n > 2) nodes named v1 , v2 ,...,vn. Two nodes vi and vj are connected if and only if 0 < │ i − j│ ≤2. Each edge (vi , vj ) is assigned a weight i+j. The cost of the minimum spanning tree of such a graph with 10 nodes is: A) 88 B)91 C)49 D)21
asked
Sep 28, 2018
in
Graph Theory
by
aditi19
Active
(
4.4k
points)

191
views
ugcnetnov2017iii
graphtheory
graphconnectivity
+4
votes
1
answer
16
Graph theory
Stmt 1: A simple graph is necessarily connected if E > (n1)*(n2)/2. Stmt2: A simple graph with n vertices and k components has at least nk edges. Can you please explain how are these results derived?
asked
Aug 26, 2018
in
Mathematical Logic
by
Nidhi Budhraja
(
197
points)

183
views
graphtheory
discretemathematics
graphconnectivity
+1
vote
1
answer
17
Kenneth Rosen Edition 6th Exercise 8.4 Question 6 (Page No. 574)
how many connected components does the following graph has ?find its connected component ?
asked
Aug 4, 2018
in
Graph Theory
by
saurab
(
21
points)

124
views
kennethrosen
discretemathematics
graphconnectivity
graphtheory
0
votes
1
answer
18
Zeal Workbook: Graph Theory  Graph Connectivity
Prove that every graph with n vertices and k components has atleast nk edges.
asked
Jul 29, 2018
in
Graph Theory
by
Prince Sindhiya
Loyal
(
5.5k
points)

58
views
zeal
graphtheory
graphconnectivity
zealworkbook
0
votes
1
answer
19
ACE Bits and bYtes
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
asked
Jul 24, 2018
in
Graph Theory
by
abhishek1995_cse
(
111
points)

181
views
graphtheory
graphconnectivity
0
votes
1
answer
20
SELF_DOUBT(MST)
What important point we keep in mind while finding the #(number) of spanning tree ?? from the given graph
asked
Apr 29, 2018
in
Algorithms
by
air1ankit
Active
(
4.2k
points)

66
views
algorithms
mst
graphconnectivity
+1
vote
1
answer
21
Graph Theory
Consider the following undirected graph with some edge costs missing. Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequalities NEED NOT hold? $cost(a,b)\geq 6$. $cost(b,e)\geq 5$. $cost(e,f)\geq 5$. $cost(a,d)\geq 4$. $cost(b,c)\geq 4$. Please someone solve and explain :)
asked
Apr 6, 2018
in
Graph Theory
by
gauravkc
Loyal
(
7.8k
points)

153
views
graphtheory
discretemathematics
graphconnectivity
Page:
1
2
3
4
5
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
Minimum Number of States in a DFA accepting a binary number divisible by 'n'
GATE 2020 Application Form Opened!
My GATE Preparation Journey
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
Follow @csegate
Recent questions tagged graphconnectivity
Recent Blog Comments
Feedback for next edition (if ever there's...
Is go book still available,I want to buy it
will pdfs be uploaded ?
50,092
questions
55,256
answers
190,785
comments
86,051
users