Register
Webpage for Graph Theory:

Recent questions tagged graph-theory

0 votes
0 answers
31
Graph Thoery
User Avatar
2 votes
1 answer
32
Chromatic Number
User Avatar
0 votes
1 answer
33
Isomorphism
User Avatar
0 votes
2 answers
37
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⌉
User Avatar
1 votes
2 answers
39
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...
User Avatar
0 votes
1 answer
40
#Graph Theory
Prove that following graph does not have Hamiltonian cycle.
Prove that following graph does not have Hamiltonian cycle.
User Avatar
0 votes
1 answer
41
What is Kurawtoski Graph?
User Avatar
0 votes
1 answer
42
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 ) ??
User Avatar
0 votes
2 answers
43
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...
User Avatar
0 votes
1 answer
46
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 ?
User Avatar
0 votes
1 answer
47
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 ...
User Avatar
1 votes
1 answer
48
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 ...
User Avatar
Page: