Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged graph
0
votes
0
answers
gate overflow book
https://gateoverflow.in/25666/tifr2013b5 The above is the link of the question. Just for the point that I have understood the solution correctly, I'm going to explain what I understood. First we are negating the edges, so any positive weight cycle ... again, we will be able to find whether there is a negative weight cycle reachable from the source. Is the explaination correct?
asked
Feb 6
in
Algorithms
by
hadarsh
(
5
points)

10
views
graph
algorithms
0
votes
0
answers
gate overflow book
https://gateoverflow.in/83854/gate19901viii The above is the link of the question. In the solution it was assumed that the graph is complete. But in the question nothing is mentioned. Also a complete graph doesn't contain self loops. So what I'm thinking is, if we ... the number of the edges in the graph, then m = n^2  m should be the condition. Please let me know about this!
asked
Feb 6
in
Graph Theory
by
hadarsh
(
5
points)

15
views
graph
0
votes
0
answers
gate overflow book
https://gateoverflow.in/4208/gate2000219 The above is the link of the question. In the question it is given that DFS results in a DFS tree T. Does this strictly imply that the graph is connected? Because if not then we can even have a disconnected graph as a counter example
asked
Feb 4
in
DS
by
hadarsh
(
5
points)

30
views
graph
algorithms
0
votes
4
answers
#DM #Graphs labeled simple graphs
How to count number of labeled simple graphs? Please explain!
asked
Aug 16, 2020
in
Graph Theory
by
mamtuj
(
25
points)

75
views
selfdoubt
graphtheory
graph
0
votes
1
answer
Trees self doubt
S1: A tree with n vertices which has no vertices of degree 2 must have at least leaves S2: The number of trees on 5 labelled vertices is 125. Which of the following statements is true? (A). Only S1 (B). Only S2 (C). Only S1 and S2 (D). None of the above
asked
May 8, 2020
in
Graph Theory
by
Abhipsa
(
17
points)

26
views
graph
trees
graphtheory
+1
vote
0
answers
Havell Hakimi Algorithm  Graph Theory
The Havell Hakimi Algorithm Requires the sorting of the degree sequence and later marking and subtracting according to that order. Does this means that the vertex with the highest degree will always have an edge with the vertex with the second ... I have noticed that without sorting the algorithm doesn't give correct output so I think it is a necessary step)
asked
May 4, 2020
in
Mathematical Logic
by
nilotpola
(
9
points)

94
views
discretemaths
graphtheory
graph
0
votes
0
answers
Graph theory 3Ordered trees possible for a given no of nodes
asked
Apr 28, 2020
in
Graph Theory
by
ramcharantej_24
(
13
points)

25
views
trees
combinatory
graphtheory
discretemaths
graph
0
votes
0
answers
Applied course test series DS
Which of the following statements is/are true? Converting an adjacency matrix representation to an adjacency list representation takes O(V+E) time. In any connected undirected graph with exactly 5 simple cycles (that do not share any edges), there are at most 10 ... between every pair of vertices Options: Only I Only II Both I and II Neither I nor II PS.: Answer is d.
asked
Jan 18, 2020
in
DS
by
Shubhranshu Maurya
(
5
points)

31
views
graph
datastructures
graphtheory
0
votes
1
answer
doubt on statement of a simple graph
i was reading about simple graph there a statement is written The mean number of edges for graphs with vertices is given by , giving the sequence for , 2, ... of 0, 1/2, 3/2, 3, 5, 15/2, 21/2, 14, 18, .. explain this statement with an example? what is this mean number of edges?
asked
Jan 5, 2020
in
Graph Theory
by
shaktisingh
(
103
points)

41
views
graphtheory
graph
0
votes
0
answers
Applied course test series : Graphs
In any connected ,undirected graph with exactly 5 simple cycles (that do not share any edges), there are atmost 10 simple paths between every pair of vertices. Whether the above given statement is true or false? Can someone explain above question?
asked
Jan 1, 2020
in
Graph Theory
by
vishal burnwal
(
77
points)

23
views
graph
0
votes
0
answers
Applied GATE grand test 4  Graph theory
State true or False with explanation.
asked
Dec 26, 2019
in
Graph Theory
by
Satbir
(
6.9k
points)

69
views
graph
graphtheory
0
votes
0
answers
Applied course test series : Graph Theory
Given below are two statements: S1 : If a Graph G is n colorable then it's also n+1 colorable . S2 : Every Bipartite graph is 2 colorable Which of the above statement(s) is/are correct? Only S1 is false Only S2 is true Both S1 and S2 are true None of the above Plz can someone explain statement 1 and what will be the answer?
asked
Dec 17, 2019
in
Graph Theory
by
vishal burnwal
(
77
points)

30
views
graph
theory
0
votes
0
answers
Applied course test series : Topological sorting
Which of the following is not the topological sorting of the below graph. A) 1,2,3,4,5,6,7,8,9,10,11 B) 1,3,2,5,4,6,7,8,9,10,11 C) 1,3,2,4,5,6,8,7,10,9,11 D) 1,3,2,4,5,6,8,7,9,10,11 My doubt is that according to me all the four orders given are correct ,but they provided (D) as the answer. Are they right?
asked
Dec 12, 2019
in
DS
by
vishal burnwal
(
77
points)

87
views
graph
0
votes
1
answer
Applied Course test series: Graph theory
Maximum no. of edges in trianglefree , simple planar graph with 10 vertices is _____ Plz give explaination and answer for above question.
asked
Dec 1, 2019
in
Graph Theory
by
vishal burnwal
(
77
points)

33
views
graph
theory
0
votes
1
answer
doubt on hamiltonian graph statement listed in mathworld.wolfram website
asked
Oct 23, 2019
in
Graph Theory
by
shaktisingh
(
103
points)

101
views
graphtheory
graph
hamiltoniangraph
0
votes
0
answers
selfDoubt in edge formula for line graph
The line graph of a graph with nodes, edges, and vertex degrees contains nodes and edges (ref. Skiena 1990, p. 137) Question : does the no of edges in line graph(given below) got through e' formula is right? I am getting no of edges in ... 3 edges but it is 8 edges as we can see in the below line graph Please validate the edge formula of the line graph.
asked
Oct 20, 2019
in
Graph Theory
by
shaktisingh
(
103
points)

44
views
graphtheory
linegraph
edges
graph
0
votes
0
answers
Introduction to algorithm by Cormen Chapter 22 Lemma 22.2
asked
Sep 9, 2019
in
Algorithms
by
Lovejeet Singh
(
5
points)

56
views
algorithms
bfs
graph
0
votes
0
answers
#Algorithms #Graphs Minimum Number of edges.
Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from vertex i to a vertex j iff either j = i+1 or j = 4i. The minimum number of edges in a path in G from vertex 1 to 100 is ? I am getting 6 ... as answer but correct answer is 9 edges. The pattern of edges I'm following  1 → 4 → 5 → 6 → 24 → 25 → 100
asked
Aug 19, 2019
in
Algorithms
by
iarnav
(
231
points)

29
views
algorithms
graph
graphtheory
0
votes
1
answer
Ace academy booklet question
S1: If a graph has a closed eulerian walk, then it has an even number of edges. S2: If G be a simple graph on 9 vertices, and the sum of all degrees in G is at least 27, then G has a vertex of degree at least four. Which of the following is true? I) Only S1 true. 2) Only S2 true. 3) Both S1 and S2 are false. 4) Both S1 and s2 true.
asked
Jul 13, 2019
in
Graph Theory
by
`JEET
(
187
points)

47
views
graph
0
votes
1
answer
ace test series 2020
asked
Jul 13, 2019
in
Algorithms
by
Rajesh Panwar
(
31
points)

25
views
graph
To see more, click for the
full list of questions
or
popular tags
.
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
9,105
questions
3,156
answers
14,593
comments
95,955
users