Q.1
##### A bridge can not be a part of _______
• a) a simple cycle
• b) a tree
• c) a clique with size ≥ 3 whose every edge is a bridge
• d) a graph which contains cycles
Q.2
##### Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called _______
• a) subgraph
• b) tree
• c) hamiltonian cycle
• d) grid
Q.3
##### G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is ______
• a) Complete bipartite graph
• b) Hamiltonian cycle
• c) Regular graph
• d) Euler graph
Q.4
• a) 98
• b) 13
• c) 6
• d) 34
Q.5
• a) 11
• b) 14
• c) 18
• d) 19
Q.6
• a) k-1
• b) k2
• c) 2k+3
• d) k3+4
Q.7
• a) n – 1
• b) n
• c) 2n+3
• d) n+1
Q.8
• a) 45
• b) 61
• c) 28
• d) 17
Q.9
##### Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between _____ and _____
• a) n-1 and n+1
• b) v and k
• c) k+1 and v-k
• d) k-1 and v-1
Q.10
• a) n+2
• b) 3n/2
• c) n2
• d) 2n