Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Graph Theory:
Recent questions tagged graph-theory
1
votes
1
answer
271
Which of the following condition is sufficient to detect cycle in a directed graph?
Which of the following condition is sufficient to detect cycle in a directed graph? (A) There is an edge from currently being visited node to an already visited node. (B) There is an edge from currently being visited node to ... seen twice in DFS. (D) None of the bove here option B is right, but why not option A?
Which of the following condition is sufficient to detect cycle in a directed graph?(A) There is an edge from currently being visited node to an already visited node.(B) T...
Gangani_Son
13.3k
views
Gangani_Son
asked
Dec 12, 2018
Algorithms
graph-theory
depth-first-search
geeksforgeeks-test-series
graph-algorithm
+
–
1
votes
2
answers
272
NIELIT 2018-70
____ number of underlined graphs can be constructed using $V=(v1,v2, \dots,vn)$. $n^3$ $2^{n(n-1)}/2$ $n-1/2$ $2^{(n-1)}/2$
____ number of underlined graphs can be constructed using $V=(v1,v2, \dots,vn)$.$n^3$$2^{n(n-1)}/2$$n-1/2$$2^{(n-1)}/2$
Arjun
1.0k
views
Arjun
asked
Dec 7, 2018
DS
nielit-2018
data-structures
graph-theory
+
–
0
votes
1
answer
273
#geeksfoegeeks #gate #2017 #mocktest
Let G be a simple graph with 20 vertices and 8 components. If we delete a vertex in G, then number of components in G should lie between ____. (A) 8 and 20 (B) 8 and 19 (C) 7 and 19 (D) 7 and 20 Answer is (C) but i think also possible (B). anyone explain?
Let G be a simple graph with 20 vertices and 8 components. If we delete a vertex in G, then number of components in G should lie between ____.(A) 8 and 20(B) 8 and 19(C) ...
Gangani_Son
1.5k
views
Gangani_Son
asked
Dec 4, 2018
Programming in C
graph-theory
+
–
0
votes
1
answer
274
Self Doubt
If a graph with n vertices has more than $\left ( n-1 \right )\left ( n-2 \right ) / 2$ edges then it is connected. I am a bit confused about this question, since I can always prove that for a graph to connected you need more than $\geq n-1$ edges.
If a graph with n vertices has more than $\left ( n-1 \right )\left ( n-2 \right ) / 2$ edges then it is connected.I am a bit confused about this question, since I can al...
jatin khachane 1
441
views
jatin khachane 1
asked
Dec 3, 2018
DS
algorithms
graph-theory
+
–
0
votes
1
answer
275
Planar Graph
Let G be a simple connected planar graph with 14 vertices and 20 edges. Number of closed regions in planar embedding of the graph is ?
Let G be a simple connected planar graph with 14 vertices and 20 edges. Number of closed regions in planar embedding of the graph is ?
Na462
3.5k
views
Na462
asked
Dec 2, 2018
Graph Theory
graph-theory
graph-planarity
+
–
0
votes
1
answer
276
Undirected Graph - Hamiltonian Cycle - NP Complete?
All the places where I have read the Ham-Cycle problem, the graph used is directed. Is the problem of finding Ham-Cycle on an undirected graph also NP-Complete or not?
All the places where I have read the Ham-Cycle problem, the graph used is directed. Is the problem of finding Ham-Cycle on an undirected graph also NP-Complete or not?
gmrishikumar
846
views
gmrishikumar
asked
Nov 30, 2018
Graph Theory
graph-theory
hamiltonian-cycle
p-np-npc-nph
+
–
4
votes
2
answers
277
Graph Coloring
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ? There is a condition that adjacent vertices should not be of the same color I am getting $1680$. Is it correct?
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ?There is a condition that adjacent...
Balaji Jegan
2.5k
views
Balaji Jegan
asked
Nov 27, 2018
Graph Theory
graph-theory
graph-coloring
combinatory
+
–
1
votes
1
answer
278
EET IITD
Churchill Khangar
597
views
Churchill Khangar
asked
Nov 23, 2018
Graph Theory
graph-theory
graph-connectivity
vertex-cover
+
–
0
votes
0
answers
279
madeesay test series
eyeamgj
235
views
eyeamgj
asked
Nov 21, 2018
Graph Theory
graph-theory
made-easy-test-series
+
–
3
votes
1
answer
280
Zeal Test Series 2019: Graph Theory - Graph Coloring
what is index ?
what is index ?
Prince Sindhiya
1.2k
views
Prince Sindhiya
asked
Nov 19, 2018
Graph Theory
zeal
graph-theory
graph-coloring
zeal2019
+
–
1
votes
1
answer
281
Zeal Test Series 2019: Graph theory - Vertex Cover
is there any easy way to do this i did it by making equation,Mn+Ec=Vn, Vc+In=Vn
is there any easy way to do this i did it by making equation,Mn+Ec=Vn, Vc+In=Vn
Prince Sindhiya
450
views
Prince Sindhiya
asked
Nov 19, 2018
Graph Theory
zeal
graph-theory
vertex-cover
zeal2019
+
–
0
votes
0
answers
282
MIT fall 2011 algorithms
Given a directed graph G, consider forming a graph G0 as follows. Each vertex u0 ∈ G0 represents a strongly connected component (SCC) of G. There is an edge (u0 , v0 ) in G0 if there is an edge in G from the SCC corresponding to u0 to the SCC corresponding ... (u0 , v0 ) in G0 if there is an edge in G from the SCC corresponding to u0 to the SCC corresponding to v0 "
Given a directed graph G, consider forming a graph G0 as follows. Each vertex u0 ∈ G0 represents a strongly connected component (SCC) of G. There is an edge (u0 , v0 ) ...
Sandy Sharma
316
views
Sandy Sharma
asked
Nov 19, 2018
Graph Theory
algorithms
graph-theory
+
–
2
votes
1
answer
283
Zeal Test Series 2019: Graph Theory - Counting
Is there any short trick to do it ?
Is there any short trick to do it ?
Prince Sindhiya
844
views
Prince Sindhiya
asked
Nov 17, 2018
Graph Theory
zeal
graph-theory
counting
zeal2019
+
–
0
votes
1
answer
284
Graph
If a graph requires k different colors for its proper coloring, then chromatic number of the graph is (a) 1 (b) k (c) k-1 (d) k/2
If a graph requires k different colors for its proper coloring, then chromatic number of the graph is(a) 1(b) k(c) k-1(d) k/2
Sriya sarkar
276
views
Sriya sarkar
asked
Nov 17, 2018
Others
graph-theory
+
–
0
votes
0
answers
285
Graph Theory(Eular walk)
$A)$ If a graph has closed Eularian walk, then it has an even number of edges $B)$ If $G$ be a simple graph on $9$ vertices and the sum of all degrees in $G$ is atleast $27$, then $G$ has a vertex of degree atleast $4$. Which Statement should be true? Is it possible B) to be true? And for A) I think "only if" is needed in place of "if" to be true
$A)$ If a graph has closed Eularian walk, then it has an even number of edges$B)$ If $G$ be a simple graph on $9$ vertices and the sum of all degrees in $G$ is atleast $2...
srestha
804
views
srestha
asked
Nov 16, 2018
Graph Theory
graph-theory
discrete-mathematics
+
–
2
votes
0
answers
286
Connected Components
Na462
1.5k
views
Na462
asked
Nov 14, 2018
Graph Theory
algorithms
graph-theory
graph-algorithm
+
–
1
votes
1
answer
287
Algorithm questions on graphs
I_am_winner
731
views
I_am_winner
asked
Nov 12, 2018
Algorithms
graph-theory
graph-algorithm
test-series
+
–
3
votes
0
answers
288
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
i didn't read the concept related to strongly connected components please it describe it for this question
Prince Sindhiya
797
views
Prince Sindhiya
asked
Nov 11, 2018
Graph Theory
zeal
graph-theory
discrete-mathematics
graph-connectivity
zeal2019
+
–
0
votes
0
answers
289
Regular graph coloring
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
dan31
1.2k
views
dan31
asked
Nov 6, 2018
Graph Theory
graph-theory
graph-coloring
+
–
2
votes
2
answers
290
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?
Consider the given statementsS1: 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 e...
dan31
2.2k
views
dan31
asked
Nov 6, 2018
Graph Theory
graph-theory
euler-graph
graph-connectivity
+
–
0
votes
0
answers
291
Regular Graph
If a 2-regular graph G has a perfect matching then which of the following is/are true? S1: G is a cycle of even length S2: Chromatic number of G is 2 S3: G is connected S4: Every component of G is an even cycle Options- A) S1,S2 B)S2,S4 C)S3,S4 D)S1,S4
If a 2-regular graph G has a perfect matching then which of the following is/are true? S1: G is a cycle of even length S2: Chromatic number of G is 2 S3: G is co...
dan31
838
views
dan31
asked
Nov 6, 2018
Graph Theory
graph-theory
discrete-mathematics
+
–
1
votes
0
answers
292
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?
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?
dan31
1.4k
views
dan31
asked
Nov 6, 2018
Graph Theory
graph-theory
graph-connectivity
+
–
0
votes
0
answers
293
algo graph questions
AB min value 10 is answer wrong here??
AB min value 10 is answer wrong here??
I_am_winner
585
views
I_am_winner
asked
Nov 6, 2018
Algorithms
graph-theory
+
–
1
votes
1
answer
294
Test Series
Let K$_n$ be such that the vertices are labeled 1,2,3,...n. The number of simple paths between v$_1$ and v$_n$ such that the labels on the path are strictly increasing ____________________
Let K$_n$ be such that the vertices are labeled 1,2,3,...n.The number of simple paths between v$_1$ and v$_n$ such that the labels on the path are strictly increasing ___...
Gupta731
742
views
Gupta731
asked
Oct 29, 2018
Graph Theory
discrete-mathematics
graph-theory
combinatory
+
–
0
votes
1
answer
295
Gateforum Test Series: Graph Theory - Graph connectivity
Gupta731
763
views
Gupta731
asked
Oct 29, 2018
Graph Theory
discrete-mathematics
graph-theory
gateforum-test-series
graph-connectivity
bipartite-graph
+
–
0
votes
1
answer
296
Planar Graph
Can minimum degree of a planar graph be $5$? Give some example
Can minimum degree of a planar graph be $5$? Give some example
srestha
1.6k
views
srestha
asked
Oct 22, 2018
Graph Theory
graph-theory
graph-planarity
+
–
0
votes
1
answer
297
Strongly connected component
How to find Strongly connected components and weakly connected components in the given graph?
How to find Strongly connected components and weakly connected components in the given graph?
Lakshman Bhaiya
3.3k
views
Lakshman Bhaiya
asked
Oct 21, 2018
Graph Theory
discrete-mathematics
graph-theory
+
–
0
votes
0
answers
298
Eulerian circuit
How many Eulerian graphs are possible?
How many Eulerian graphs are possible?
Lakshman Bhaiya
1.5k
views
Lakshman Bhaiya
asked
Oct 21, 2018
Graph Theory
engineering-mathematics
discrete-mathematics
graph-theory
+
–
0
votes
1
answer
299
articulation point
How many numbers of Articulation Points (Cut Vertices) in a Graph are possible?
How many numbers of Articulation Points (Cut Vertices) in a Graph are possible?
Lakshman Bhaiya
391
views
Lakshman Bhaiya
asked
Oct 21, 2018
Graph Theory
discrete-mathematics
graph-theory
+
–
0
votes
0
answers
300
Graph
$1)$How many different adjacency matrices does a graph with n vertices and E edges have? $2)$How many different adjacency lists does a graph with n vertices have?
$1)$How many different adjacency matrices does a graph with n vertices and E edgeshave?$2)$How many different adjacency lists does a graph with n vertices have?
Lakshman Bhaiya
884
views
Lakshman Bhaiya
asked
Oct 21, 2018
DS
data-structures
graph-theory
+
–
Page:
« prev
1
...
5
6
7
8
9
10
11
12
13
14
15
...
30
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register