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 tagged graphconnectivity
0
votes
5
answers
1
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
2
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.1k
views
gate2019
engineeringmathematics
discretemathematics
graphtheory
graphconnectivity
+1
vote
1
answer
3
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
(
8.7k
points)

67
views
graphtheory
graphconnectivity
madeeasytestseries2019
madeeasytestseries
0
votes
0
answers
4
Zeal Test Series 2019: Graph Theory  Graph Connectivity
asked
Dec 22, 2018
in
Graph Theory
by
Prince Sindhiya
Loyal
(
6.3k
points)

44
views
zeal
graphtheory
graphconnectivity
zeal2019
+2
votes
0
answers
5
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
(
6.3k
points)

97
views
zeal
graphtheory
discretemathematics
graphconnectivity
zeal2019
+1
vote
1
answer
6
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
(
869
points)

126
views
graphtheory
eulergraph
graphconnectivity
+1
vote
0
answers
7
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
(
869
points)

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

62
views
discretemathematics
graphtheory
gateforumtestseries
graphconnectivity
+2
votes
3
answers
9
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
(
17.2k
points)

195
views
gb2019ds2
graphtheory
graphconnectivity
+2
votes
1
answer
10
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
(
17.2k
points)

113
views
gb2019ds2
graphconnectivity
+1
vote
0
answers
11
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
(
2.9k
points)

101
views
ugcnetnov2017iii
graphtheory
graphconnectivity
+4
votes
1
answer
12
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
(
263
points)

158
views
graphtheory
discretemathematics
graphconnectivity
+1
vote
1
answer
13
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
(
27
points)

106
views
kennethrosen
discretemathematics
graphconnectivity
graphtheory
0
votes
1
answer
14
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
(
6.3k
points)

47
views
zeal
graphtheory
graphconnectivity
zealworkbook
0
votes
1
answer
15
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
(
169
points)

158
views
graphtheory
graphconnectivity
0
votes
1
answer
16
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.5k
points)

59
views
algorithms
mst
graphconnectivity
0
votes
1
answer
17
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.9k
points)

144
views
graphtheory
discretemathematics
graphconnectivity
+1
vote
2
answers
18
Graph Theory
Can someone solve this? Also please attempt this question on Algorithms time complexity if interested :) https://gateoverflow.in/210836/algorithmstimecomplexity
asked
Apr 5, 2018
in
Graph Theory
by
gauravkc
Loyal
(
7.9k
points)

145
views
graphtheory
discretemathematics
graphconnectivity
0
votes
1
answer
19
Kenneth Rosen Edition 6th Exercise 8.4 Question 70 (Page No. 565 )
How much storage is needed to represent a simple graph with n vertices and m edges using. a) adjacency lists? b) an adjacency matrix? c) an incidence matrix?
asked
Mar 1, 2018
in
Graph Theory
by
Mk Utkarsh
Boss
(
34.8k
points)

138
views
graphtheory
kennethrosen
discretemathematics
graphconnectivity
+20
votes
2
answers
20
GATE201843
Let $G$ be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1, 2,.., 100. There is an edge between vertices $u$ and $v$ if and only if the label of $u$ ... $y$ denote the degree of a vertex in $G$, and $z$ denote the number of connected components in $G$. Then,$y+10z$ = ____
asked
Feb 14, 2018
in
Algorithms
by
gatecse
Boss
(
18.2k
points)

4.5k
views
gate2018
algorithms
graphalgorithms
graphconnectivity
numericalanswers
+2
votes
0
answers
21
DFS depth first search
asked
Jan 25, 2018
in
DS
by
budhu
(
159
points)

97
views
datastructure
dfs
graphalgorithms
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
How to prepare for IISC Interdisciplinary Mathematical Sciences Interview
GO Hardcopy for GATE 2020
How to prepare for BARC interview
IIIT H
Tips for COAP2019
Follow @csegate
Recent questions tagged graphconnectivity
Recent Blog Comments
What is the cutoff for M.Tech AI at IISc?
Yup. Hard copy contains a unique QR code for...
Lol. I got left out of IIT Kanpur GATE cutoff by...
Don't worry brother... i hope fate is also get...
50,049
questions
53,194
answers
184,531
comments
70,402
users