Graph Theory
Ques1. In a 7-node directed cyclic graph, the number of Hamiltonian cycle is to be
______
a) 728
b) 450
c) 360
d) 260
Answer: c
Ques2. . If each and every vertex in G has degree at most 23 then G can have a vertex
colouring of __________
a) 24
b) 23
c) 176
d) 54
Answer: a
Ques3. Triangle free graphs have the property of clique number is __________
a) less than 2
b) equal to 2
c) greater than 3
d) more than 10
Answer: d
Ques4. Berge graph is similar to ______ due to strong perfect graph theorem.
a) line graph
b) perfect graph
c) bar graph
d) triangle free graph
Answer: b
Ques5. Let D be a simple graph on 10 vertices such that there is a vertex of degree 1,
a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a vertex of degree 5, a
vertex of degree 6, a vertex of degree 7, a vertex of degree 8 and a vertex of degree 9.
What can be the degree of the last vertex?
Graph Theory
a) 4
b) 0
c) 2
d) 5
Answer: c
Ques6. A ______ is a graph which has the same number of edges as its complement
must have number of vertices congruent to 4m or 4m modulo 4(for integral values of
number of edges).
a) Subgraph
b) Hamiltonian graph
c) Euler graph
d) Self complementary graph
Answer: d
Ques7. In a ______ the vertex set and the edge set are finite sets.
a) finite graph
b) bipartite graph
c) infinite graph
d) connected graph
Answer: b
Ques8. If G is the forest with 54 vertices and 17 connected components, G has
_______ total number of edges.
a) 38
b) 37
c) 17/54
d) 17/53
Answer: b
Ques9. The number of edges in a regular graph of degree 46 and 8 vertices is
____________
a) 347
b) 230
Graph Theory
c) 184
d) 186
Answer: c
Ques10. An undirected graph G has bit strings of length 100 in its vertices and there is
an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position.
Determine the ratio of the chromatic number of G to the diameter of G?
a) 1/2101
b) 1/50
c) 1/100
d) 1/20
Answer: b
Ques11. If a partial order is drawn as a Hasse diagram in which no two edges cross, its covering
graph is called ______
a) upward planar
b) downward planar
c) lattice
d) biconnected components
Answer: a
Ques12. If the partial order of a set has at most one minimal element, then to test whether it has
a non-crossing Hasse diagram its time complexity __________
a) NP-complete
b) O(n2)
c) O(n+2)
d) O(n3)
Answer: a
Ques13. Which of the following relation is a partial order as well as an equivalence relation?
a) equal to(=)
b) less than(<)
c) greater than(>)
d) not equal to(!=)
Graph Theory
Answer: a
Ques14. The relation ≤ is a partial order if it is ___________
a) reflexive, antisymmetric and transitive
b) reflexive, symmetric
c) asymmetric, transitive
d) irreflexive and transitive
Answer: a
Ques15. Let G be the graph defined as the Hasse diagram for the ⊆ relation on the set S{1, 2,…,
18}. How many edges are there in G?
a) 43722
b) 2359296
c) 6487535
d) 131963
Answer: b
Ques16. The maximum number of edges in a bipartite graph on 14 vertices is ___________
a) 56
b) 14
c) 49
d) 87
Answer: c
Ques17. The time complexity to test whether a graph is bipartite or not is said to be _______
using depth first search.
a) O(n3)
b) linear time
c) O(1)
d) O(nlogn)
Answer: b
Graph Theory
Ques18. The partition V = V 1 ∪ V2 in a bipartite graph G1 is called ________
a) bipartition of G1
b) 2-vertex set of G1
c) sub bipartite graphs
d) disjoint vertex set
Answer: b
Ques19. What is the maximum number of edges in a bipartite graph on 14 vertices?
a) 78
b) 15
c) 214
d) 49
Answer: d
Ques20. In a complete bipartite graph, the intersection of two sub graphs is ______
a) 1
b) null
c) 210
d) 412
Answer: b
