1.

In an undirected graph the number of nodes with odd degree must be

Zero
Odd
Prime
Even
2. A graph is a collection of

Row and columns

Vertices and edges
Equations
None of these
3. In a graph if e=(u, v) means

u is adjacent to v but v is not adjacent to u

e begins at u and ends at v
u is processor and v is successor
both b and c
4. In a graph if e=[u, v], Then u and v are called

Endpoints of e
Adjacent nodes
Neighbors
All of above
5. A graph with n vertices will definitely have a parallel edge or self loop if the total
number of edges are

greater than n1
less than n(n1)
greater than n(n1)/2
less than n2/2
6. A vertex of a graph is called even or odd depending upon

Total number of edges in a graph is even or odd

Total number of vertices in a graph is even or odd
Its degree is even or odd
None of these
7. In any undirected graph the sum of degrees of all the nodes

Must be even
Are twice the number of edges
 Must be odd
Need not be even
8. A graph with one vertex and no edges is

multigraph
digraph
isolated graph
trivial graph
9. A graph with no edges is known as empty graph. Empty graph is also known as

Trivial graph
Regular graph
Bipartite graph
None of these
10. Choose the most appropriate definition of plane graph

A graph drawn in a plane in such a way that any pair of edges meet only at their end vertices
A graph drawn in a plane in such a way that if the vertex set of graph can be partitioned into
two non - empty disjoint subset X and Y in such a way that each edge of G has one end in X
and one end in Y
A simple graph which is Isomorphic to Hamiltonian graph
None of these

11. The maximum degree of any vertex in a simple graph with n vertices is

n1
n+1
2n1
n
12. The complete graph with four vertices has k edges where k is

3
4
5
6
13. Suppose v is an isolated vertex in a graph, then the degree of v is

0
1
2
3
14. Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G
so that the graph is not connected is

A. 2451

B. 4950

C. 4851

D. 9900

15. A graph in which all nodes are of equal degrees is known as: (A) Multigraph (B) Regular
graph (C) Complete lattice (D) non regular graph
Ans:B
16. In an undirected graph the number of nodes with odd degree must be (A) Zero (B) Odd (C)
Prime (D) Even
Ans:D

17.

18.
19.

20.

21.

22.

23.
24.
25. The number of diagonals that can be drawn by joining the vertices of an octagon is:
(A) 28 (B) 48 (C) 20 (D) 24
Ans:C