1:b false

2:b Regular graph

3:c both P and Q
4:b atleast two vertices have the same degree
5:c 2, 4
6:c 36
7:b n(n-1)/2
8:d 19
9:d complete graph
10:a (1/2)v(v-1)
11:b both i and iii
12:c Even degree
13:c The number of vertices of even degree is even
14:a Source
15:b i)cycle ii)simple path iii)not a path
16:b, degree is not even for all vertex.
17:b
18:trivial graph
19:d Kuratowski's second graph
20:b sink
21:c G1 ? G2=(V1 U V2, E1 ? E2)
22:d simple graph
23:a Size of the graph
24:c Isolated vertex
25:a Kuratowski's first graph (K5)
26:twice the number of edges
27:b 3
28:c Spanning subgraph
29:Leonhard Euler
30:c Order of the graph