Graph theory and its Applications

Quiz 1 MS/ PhD Mathematics

Question No. Answer Question No. Answer

1 6
2 7
3 8
4 9
5 10

Q 1: In graph theory, it is possible that two graphs might look (at least to the uneducated eye)
exceedingly dissimilar, yet in actuality be equal. How can we determine whether or not two graphs
are equal?

a) Equal graphs are always drawn in such a way that they immediately appear equal.
b) Two graphs are equal if there is a one-to-one correspondence between their vertex sets, so that
when two vertices of one graph are adjacent, the corresponding vertices of the other graph are
adjacent.
c) Two graphs are equal if they have equal vertex sets and equal edge sets.
d) Two graphs are equal if they contain the same number of vertices and edges.

Q2: Isomorphism is similar to equality, but more general. Of the following common graphs, which two
are isomorphic?

a) The path graph on four vertices and the complete graph on four vertices.
b) The cyclic graph on three vertices and the complete graph on three vertices.
c) The utility graph and the complete graph on six vertices.
d) The cyclic graph on five vertices and the wheel graph on five vertices.

Q3: Which of the following graphs can be drawn without edge crossings?

a) The complete graph on five vertices. The complete graph on five vertices.
b) The wheel graph on ten vertices.
c) The complete graph on six vertices.
d) The utility graph.

Q4: A non-planar graph with a minimum number of vertices has

(a) 9 edges, 6 vertices
(b) 6 edges, 4 vertices
 (c) 10 edges, 5 vertices
(d) 9 edges, 5 vertices

Q5: The number of distinct simple graphs with up to three nodes is

(a) 15 (b) 10 (c) 7 (d) 9

Q6: Maximum number of edges in a n-node undirected graph without self-loops is

(a) n2 (b) n(n – 1)/2 (c) n-1 (d) (n + 1) (n)/2

Q7: What is the maximum number of edges in an acyclic undirected graph with n vertices?
(a) n – 1 (b) n (c) n+1 (d) 2n-1

Q8: What is the number of vertices in an undirected connected graph with 27 edges, 6 vertices of
degree 2, 3 vertices of degree 4, and the remaining of degree 3?
(a) 10 (b) 11 (c) 18 (d) 19

Q9: Which one of the following graphs is NOT planner?

a) A (b) B (c) C (d) d

Q10: Which of the following graphs is/are planar?