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
2
answers
571
graph theory
Vicky rix
471
views
Vicky rix
asked
Mar 8, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
engineering-mathematics
+
–
0
votes
1
answer
572
graph theory
Vicky rix
362
views
Vicky rix
asked
Mar 8, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
engineering-mathematics
+
–
0
votes
2
answers
573
graph theory
Vicky rix
381
views
Vicky rix
asked
Mar 8, 2017
Graph Theory
graph-theory
discrete-mathematics
engineering-mathematics
+
–
11
votes
2
answers
574
ISI2015-PCB-C3
For a positive integer $n$, let $G = (V, E)$ be a graph, where $V = \text{{0,1}}^n$, i.e., $V$ is the set of vertices has one to one correspondence with the set of all $n$-bit binary strings and $E = \{(u,v) \mid u, v$ belongs to $V, u$ and $v$ differ in exactly one bit position$\}$. Determine size of $E$ Show that $G$ is connected
For a positive integer $n$, let $G = (V, E)$ be a graph, where $V = \text{{0,1}}^n$, i.e., $V$ is the set of vertices has one to one correspondence with the set of all $n...
Devasish Ghosh
1.5k
views
Devasish Ghosh
asked
Mar 8, 2017
Graph Theory
graph-theory
discrete-mathematics
isi2015
graph-connectivity
+
–
1
votes
1
answer
575
IIT Kanpur written
If a graph has k-independent components, it it n-k+1 colorable
If a graph has k-independent components, it it n-k+1 colorable
Shreya Roy
304
views
Shreya Roy
asked
Feb 28, 2017
Algorithms
graph-algorithms
graph-theory
+
–
44
votes
9
answers
576
GATE CSE 2017 Set 2 | Question: 23
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
Madhav
17.5k
views
Madhav
asked
Feb 14, 2017
Graph Theory
gatecse-2017-set2
graph-theory
numerical-answers
degree-of-graph
+
–
0
votes
0
answers
577
How to Calculate No of Simple graph with labelled vertices?
No of Simple Undirected Graph with unablled vertices - 2nC2 No of Simple Undirected Graph with labelled vertices - ? No of Simple Undirected Connected Graph with unablled vertices - ? No of Simple Undirected Connected Graph with labelled vertices - ?
No of Simple Undirected Graph with unablled vertices - 2nC2No of Simple Undirected Graph with labelled vertices - ?No of Simple Undirected Connected Graph with unablled v...
yg92
451
views
yg92
asked
Feb 5, 2017
Programming in C
graph-theory
graph-algorithms
data-structures
algorithms
combinatory
+
–
0
votes
0
answers
578
GRAPH TRAVERSALS
WHY CROSS EDGES TURN TO BE BACK EDGES IN UNDIRECTED GRAPH IN DFS TRAVERSAL?? CAN ANYONE EXPLAIN THIS. WHY ARE THERE NO CROSS EDGES IN DFS OF UNDIRECTED GRAPH??
WHY CROSS EDGES TURN TO BE BACK EDGES IN UNDIRECTED GRAPH IN DFS TRAVERSAL?? CAN ANYONE EXPLAIN THIS. WHY ARE THERE NO CROSS EDGES IN DFS OF UNDIRECTED GRAPH??
sushmita
287
views
sushmita
asked
Feb 3, 2017
Programming in C
graph-theory
data-structures
tree-traversal
+
–
0
votes
1
answer
579
graph theory , clique and isolated graph
here in this question they have asked about the number of edges but i cant find a way to solve pls help here...
here in this question they have asked about the number of edges but i cant find a way to solve pls help here...
S Ram
672
views
S Ram
asked
Feb 2, 2017
Others
graph-theory
discrete-mathematics
+
–
4
votes
2
answers
580
Euler Path
Which of the following Graph has Euler Path but is not an Euler Graph? A. K1,1 B.K2,10 C.K2,11 D.K10,11.
Which of the following Graph has Euler Path but is not an Euler Graph?A. K1,1 B.K2,10 C.K2,11D.K10,11.
Jason GATE
2.0k
views
Jason GATE
asked
Jan 31, 2017
Graph Theory
graph-theory
euler-graph
euler-path
+
–
0
votes
1
answer
581
graph theory
How many distinct paths of length 4 that do not visit the same node more than once are there between node 0 and node 1?
How many distinct paths of length 4 that do not visit the same node more than once are there between node 0 and node 1?
Arnabi
257
views
Arnabi
asked
Jan 30, 2017
Graph Theory
graph-theory
discrete-mathematics
+
–
0
votes
1
answer
582
VirtualGate Test Series: Discrete Mathematics - Graph Theory
$G$ be a simple graph on $8$ vertices such that there is a vertices of degrees $1,2,3,4,5,6,7$ respectively, Then which of the following can be the degree of the last vertex$?$ $3$ $0$ $5$ $4$
$G$ be a simple graph on $8$ vertices such that there is a vertices of degrees $1,2,3,4,5,6,7$ respectively, Then which of the following can be the degree of the last ver...
smartmeet
512
views
smartmeet
asked
Jan 27, 2017
Graph Theory
discrete-mathematics
graph-theory
degree-of-vertices
virtual-gate-test-series
+
–
1
votes
0
answers
583
Testbook Test Series 2017: Graph Theory - Graph Connectivity
Hradesh patel
690
views
Hradesh patel
asked
Jan 26, 2017
Graph Theory
testbook-test-series
test-series
graph-theory
graph-connectivity
+
–
2
votes
2
answers
584
MadeEasy Subject Test: Algorithms - Graph Connectivity
vaishali jhalani
1.1k
views
vaishali jhalani
asked
Jan 24, 2017
Graph Theory
graph-theory
graph-connectivity
made-easy-test-series
+
–
4
votes
1
answer
585
Virtual Gate Test Series: Discrete Mathematics - Graph Theory (Complete Graph)
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 in $G.$ How many simple paths are there from $\text{u to v}$ going through $\text{w?}$
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 vert...
Samujjal Das
1.1k
views
Samujjal Das
asked
Jan 24, 2017
Graph Theory
discrete-mathematics
graph-theory
complete-graph
virtual-gate-test-series
+
–
2
votes
1
answer
586
Test by Bikram | Mock GATE | Test 2 | Question: 52
An $Euler$ circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Which of the following undirected graphs must have an $Euler$ circuit? A complete graph with $12$ vertices A complete graph with $13$ vertices A tree with $13$ vertices I and II III only II only I and III
An $Euler$ circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Which of the following undirected graphs must have an $Euler$...
Bikram
375
views
Bikram
asked
Jan 24, 2017
Graph Theory
tbb-mockgate-2
discrete-mathematics
graph-theory
euler-graph
+
–
1
votes
1
answer
587
Testbook
I am not getting how statement 3 is false and statement 4 is true. Statement 3: If the weights are unique, ho can there be multiple second best spanning trees? Statement 4: If the graph is triangle, wont there be any spanning tree?
I am not getting how statement 3 is false and statement 4 is true.Statement 3: If the weights are unique, ho can there be multiple second best spanning trees?Statement 4:...
Sushant Gokhale
508
views
Sushant Gokhale
asked
Jan 23, 2017
Programming in C
graph-theory
+
–
0
votes
1
answer
588
Graph Theory Problem-Test Series
A Connected Graph has Cut edge, Then Graph has Cut vertex also. 1. True 2. False Choose Correct One.
A Connected Graph has Cut edge, Then Graph has Cut vertex also.1. True2. FalseChoose Correct One.
parthbkgadoya
4.1k
views
parthbkgadoya
asked
Jan 20, 2017
Graph Theory
graph-theory
engineering-mathematics
+
–
0
votes
1
answer
589
MadeEasy Subject Test: Engineering Mathematics- Graph Connectivity
vaishali jhalani
557
views
vaishali jhalani
asked
Jan 20, 2017
Graph Theory
made-easy-test-series
discrete-mathematics
graph-theory
vertex-cover
maximum-independent
+
–
1
votes
0
answers
590
Disconnected components
vaishali jhalani
261
views
vaishali jhalani
asked
Jan 19, 2017
Algorithms
graph-theory
+
–
0
votes
1
answer
591
Graph Theory
Let G be a undirected graph with 35 edges and degree of each vertex is at least 3 then maximum number of vertices possible in G is (A) 22 (B) 23 (C) 24 (D) 25 P.S. Explain with ease, if possible!
Let G be a undirected graph with 35 edges and degree of each vertex is at least 3 then maximum number of vertices possible in G is(A) 22(B) 23(C) 24(D) 25P.S. Explain wit...
smartmeet
860
views
smartmeet
asked
Jan 18, 2017
Graph Theory
graph-theory
engineering-mathematics
discrete-mathematics
+
–
0
votes
1
answer
592
Graph Theory
How to learn and understand graph theory in 23 days i mean before gate exam? Can anybody help in this.Like there are many new terms bipartite graph etc etc i m not able to learn some complicated names ? Any video lectures or anything please help :)
How to learn and understand graph theory in 23 days i mean before gate exam? Can anybody help in this.Like there are many new terms bipartite graph etc etc i m not able ...
Himanshu Goyal
461
views
Himanshu Goyal
asked
Jan 17, 2017
Graph Theory
graph-theory
+
–
4
votes
2
answers
593
What is the expected length of the cycle containing vertex 1?
A random permutation π of set[n] = {1, 2, , n} can be represent by a directed graph on n vertices with directed arc (i, πi) where πi is the ith entry in the permutation. Observe that the resulting graph is just a collection of disjoint cycles. ... containing vertex 1? n(n-1)/2n (n+1)/2n ((n-1))/2 ((n+1))/2 /pls explain the question
A random permutation π of set[n] = {1, 2, …, n} can be represent by a directed graph on n vertices with directed arc (i, πi) where πi is the ith entry in the permuta...
Akriti sood
1.7k
views
Akriti sood
asked
Jan 16, 2017
Graph Theory
expectation
graph-theory
engineering-mathematics
+
–
3
votes
2
answers
594
How many maximum cycles possible in any Complete graph? (Unlabelled nodes)
smartmeet
1.8k
views
smartmeet
asked
Jan 14, 2017
Graph Theory
graph-theory
cycle
+
–
0
votes
0
answers
595
Graph Theory
Çșȇ ʛấẗẻ
162
views
Çșȇ ʛấẗẻ
asked
Jan 12, 2017
Programming in C
graph-theory
discrete-mathematics
+
–
2
votes
2
answers
596
#Chromatic number , Planarity
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number of G) a) 2 b) 3 c) 4 d) None of these PS : (Explain: "every face is bordered by exactly 3 edges. ")
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number...
smartmeet
1.4k
views
smartmeet
asked
Jan 11, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-coloring
+
–
3
votes
3
answers
597
Testbook Test Series: Programming & DS - Graphs
focus _GATE
752
views
focus _GATE
asked
Jan 11, 2017
Programming in C
testbook-test-series
test-series
data-structures
depth-first-search
graph-theory
+
–
0
votes
4
answers
598
GateForum Test Series: Graph Theory - Graph Coloring
The Chromatic Number of Cycle Graph with 7 vertices _____
The Chromatic Number of Cycle Graph with 7 vertices _____
Jason GATE
2.4k
views
Jason GATE
asked
Jan 9, 2017
Graph Theory
gateforum-test-series
engineering-mathematics
discrete-mathematics
graph-theory
graph-coloring
+
–
0
votes
0
answers
599
Testbook
The relation between size of a maximum matching in a disconnected graph G on vertex set V and the size of a maximum matching of a connected graph G on same vertex set V is (A) < (B) (C) (D) None of the above.
The relation between size of a maximum matching in a disconnected graph G on vertex set V and the size of a maximum matching of a connected graph G on same vertex set V...
Sarvottam Patel
483
views
Sarvottam Patel
asked
Jan 8, 2017
Mathematical Logic
graph-theory
+
–
1
votes
1
answer
600
if graph is loop free then how can it have cycle
firki lama
978
views
firki lama
asked
Jan 6, 2017
Graph Theory
graph-theory
+
–
Page:
« prev
1
...
15
16
17
18
19
20
21
22
23
24
25
...
30
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register