Recent questions tagged graph-theory

0 votes
1 answer
31
0 votes
2 answers
35
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⌉
1 votes
2 answers
37
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...
0 votes
1 answer
38
0 votes
1 answer
39
0 votes
1 answer
40
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
0 votes
2 answers
41
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...
0 votes
1 answer
44
0 votes
1 answer
45
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 ...
1 votes
1 answer
46
0 votes
2 answers
49
Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one.