Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Graph Theory:
Recent questions tagged graph-theory
0
votes
1
answer
31
Isomorphism
Çșȇ ʛấẗẻ
180
views
Çșȇ ʛấẗẻ
asked
Aug 28, 2023
Mathematical Logic
graph-theory
+
–
0
votes
1
answer
32
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
ronakagarawal
230
views
ronakagarawal
asked
Aug 23, 2023
Graph Theory
engineering-mathematics
graph-theory
+
–
0
votes
0
answers
33
Made Easy Test Series 2024
Suppose we have a directed graph G = (V,E) with V= {1, 2, ..., n} and Eis presented as an adjacency list. For each vertex u in V, out(u) is a list such that (u, v) in {1, 2, ... k). For each u in V, we wish to compute a corresponding list in(u) =such that in E ... take to construct the lists in(u), u in V, from the lists out(u), u in V? T(n) =O(n+m) B. T(n)= O(n(m+n))
Suppose we have a directed graph G = (V,E) with V= {1, 2, ..., n} and Eis presented as an adjacency list. For each vertex u in V, out(u) is a list such that (u, v) in {1,...
Ray Tomlinson
506
views
Ray Tomlinson
asked
Aug 9, 2023
Algorithms
made-easy-test-series
algorithms
made-easy-booklet
algorithm-design
time-complexity
linked-list
graph-theory
graph-algorithm
+
–
0
votes
1
answer
34
#Graph Theory
Çșȇ ʛấẗẻ
287
views
Çșȇ ʛấẗẻ
asked
Aug 3, 2023
Algorithms
graph-theory
discrete-mathematics
algorithms
+
–
0
votes
2
answers
35
Ace workbook: If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉
yuuchan
475
views
yuuchan
asked
Jul 22, 2023
Graph Theory
graph-theory
engineering-mathematics
+
–
1
votes
1
answer
36
Planar Graph (Self Doubt)
This is a graph ? Is it planar or not ? As per definition of planar graph it can be drawn in such a way that no edges cross each other. other theorems are if a connected simple graph is planar→ e<=3n-6 if a connected simple graph is planar → ... for planar graph not meet if the graph is planar but Now if i draw i dont intersect any edges .,which show it is planar
This is a graph ? Is it planar or not ?As per definition of planar graph it can be drawn in such a way that no edges cross each other.other theorems are if a connected si...
Rajib Datta Roy
298
views
Rajib Datta Roy
asked
Jul 18, 2023
Algorithms
self-doubt
graph-theory
graph-planarity
discrete-mathematics
+
–
1
votes
2
answers
37
Graphy theory Gate wallah practice sheet #6
Consider a complete graph with size 2016. Suppose after deletion of 2 vertices from the above graph, the modified graph have x number of edges and y number of vertices. Find the value of x – y ?
Consider a complete graph with size 2016. Suppose after deletion of 2 vertices from the above graph, the modified graph have x number of edges and y number of vertices. F...
gagan55
452
views
gagan55
asked
Jul 3, 2023
Graph Theory
graph-theory
discrete-mathematics
+
–
0
votes
1
answer
38
#Graph Theory
Prove that following graph does not have Hamiltonian cycle.
Prove that following graph does not have Hamiltonian cycle.
Çșȇ ʛấẗẻ
471
views
Çșȇ ʛấẗẻ
asked
Jul 3, 2023
Graph Theory
graph-theory
discrete-mathematics
+
–
0
votes
1
answer
39
What is Kurawtoski Graph?
Saurabhgate2024
147
views
Saurabhgate2024
asked
Jul 1, 2023
Graph Theory
graph-theory
+
–
0
votes
1
answer
40
Graph theory self doubt
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
gagan55
177
views
gagan55
asked
Jun 30, 2023
Graph Theory
graph-theory
discrete-mathematics
+
–
0
votes
2
answers
41
SCIENTIST B CPCB 2023 CSE
Consider a graph with n vertices that is a collection of k disjoint trees, where 𝑛 > 𝑘 > 1 . How many edges does this graph have? (A) n-1 (B) k (n-1) (C) n-k (D) n-k-1
Consider a graph with n vertices that is a collection of k disjoint trees, where 𝑛 𝑘 1 . How many edges does this graph have?(A) n-1 (B) k (n-1) (C) n-k (D) n-k-1...
Jai Singh
444
views
Jai Singh
asked
Jun 26, 2023
CO and Architecture
algorithms
graph-theory
graph-algorithm
graph-connectivity
+
–
0
votes
1
answer
42
#Graph Theory
Çșȇ ʛấẗẻ
136
views
Çșȇ ʛấẗẻ
asked
Jun 26, 2023
Mathematical Logic
graph-theory
discrete-mathematics
graph-coloring
+
–
0
votes
0
answers
43
Hasse Diagram
Çșȇ ʛấẗẻ
282
views
Çșȇ ʛấẗẻ
asked
May 11, 2023
Mathematical Logic
hasse-diagram
set-theory&algebra
lattice
graph-theory
+
–
0
votes
1
answer
44
Planar Graphs | Graph Theory | Selfdoubt
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
Dhiraj_777
488
views
Dhiraj_777
asked
May 4, 2023
Graph Theory
self-doubt
graph-planarity
graph-theory
+
–
0
votes
1
answer
45
Byju's graph theory coloring question
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ . The find the minimum number of colours required ot edge-colour is ?
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ .The find the minimum number of colours required ot edge-colour is ...
Sahil_Lather
439
views
Sahil_Lather
asked
Apr 15, 2023
Graph Theory
graph-coloring
graph-theory
byjus-practice-book
+
–
1
votes
1
answer
46
Self Made Question
Consider a connected undirected graph G with n vertices, where n > 4. Suppose that G has the property that every vertex has a degree of at least n/2, i.e., deg(v) ≥ n/2 for all vertices v in G. Prove that G must contain a cycle of length at most 3n/4.
Consider a connected undirected graph G with n vertices, where n 4. Suppose that G has the property that every vertex has a degree of at least n/2, i.e., deg(v) ≥ n/2 ...
LRU
318
views
LRU
asked
Apr 14, 2023
Graph Theory
graph-theory
bipartite-graph
self-doubt
+
–
0
votes
1
answer
47
Self Made Question
Let G be a bipartite graph with vertex sets V1 and V2, where |V1| = 12 and |V2| = 18. Suppose that G has a perfect matching, which is a set of edges that covers all vertices in G. What is the minimum number of colors needed to properly color G such that no adjacent vertices share the same color, and how does it relate to the chromatic number of G? Justify your answer.
Let G be a bipartite graph with vertex sets V1 and V2, where |V1| = 12 and |V2| = 18. Suppose that G has a perfect matching, which is a set of edges that covers all verti...
LRU
254
views
LRU
asked
Apr 14, 2023
Graph Theory
graph-theory
bipartite-graph
numerical-answers
+
–
1
votes
1
answer
48
Self Made Question
Consider a bipartite graph G with vertex sets V1 and V2, where |V1| = 10 and |V2| = 15. What is the minimum number of colors needed to properly color G such that no adjacent vertices share the same color? Justify your answer and explain how it is related to the chromatic number of G.
Consider a bipartite graph G with vertex sets V1 and V2, where |V1| = 10 and |V2| = 15. What is the minimum number of colors needed to properly color G such that no adjac...
LRU
192
views
LRU
asked
Apr 14, 2023
Graph Theory
graph-theory
bipartite-graph
numerical-answers
+
–
0
votes
2
answers
49
#graph #degreeofgraph
Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one.
Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one.
Shivshankar
447
views
Shivshankar
asked
Apr 14, 2023
IS&Software Engineering
graph-theory
+
–
Page:
« prev
1
2
3
4
5
6
7
...
30
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register