GRAPH THEORY: B.Sc.

, MATHEMATICS
SUB. CODE: 17UMA6C16
UNIT -1

1) The vertices vi and vj associated with edge ek are called the ____ of ek

a) common vertices b) isolated vertices c) end vertices d) trivial vertices

2) A graph that has neither self loop nor parallel edges is called_____ graph

a) trivial b) regular c) simple d) complete

3) In a graph, an edge having the same vertex as both its end vertices is called______

a) link b)loop c) planar d) trivial

4) More than one edge associated with the given pair of vertices is called______

a) self loop b) branches c) chords d) parallel edges

5) Koingsberg bridge problem is related to_______

a) Gauss b) Fisher c) Euler d)Hamilton

6) A graph with finite number vertices as well as finite number of edges is called_____ graph

a) a finite b) an infinite c) a clique d) a complete

7) Two non parallel edges are said to be _____ if they are incident on a common vertex

a) incident b) adjacent c) equal d) not equal

8) The number of odd degree in a graph is always_______

a) odd b) even c) zero d) one

9) A connected graph is ______ if and only if it has exactly two vertices of degree

a) Euler b) Hamilton c) unicursal d) regular

10) The length of the Hamiltonian path in a connected graph of n vertices is _____
a) n b) n-1 c) n-2 d) n+1

11) A vertex with degree one is called a ______

a) pendant b) isolated c) end d) null
12) A graph without any edges is called a _____ graph

a) isolated b) regular c) null d) simple

13) Every vertex in a null graph is _____ vertex

a) a pendant b) an isolated c) a end d) a null

14) Every graph is its own ______ graph

a) super b) sub c) edge disjoint d) vertex disjoint

15) A single vertex in a graph G is a ______ graph of G

a) super b) sub c) perfect d) isolated

16) A closed walk in which no vertex appears more than once is called a _____

a) circuit b) elementary chain c) edge train d) trail

17) A simple graph in which there exists an edge between every pair of vertices is called a ____ graph

a) regular b) complete c) Euler d) connected

18) In a simple graph in which there exists a path between every pair of vertices is called a ____ graph

a) regular b) complete c) Euler d) connected

19) An Euler graph G is arbitrary traceable from vertex v in G if and only if every____ in G contains V

a) path b) circuit c) walk d) trail

20) If some closed walk in a graph contains all the edges of the graph, then the graph is called____ graph

a) an isomorphic b) a Hamilton c) an unicursal d) an Euler

UNIT - 2

21) A connected graph without any circuit is _______

a) loop b) tree c) Euler graph d) path

22) In any tree, there are at least _____ pendant vertices

a) 1 b) 2 c) 3 d) 0

23) A tree with n vertices has ______ edges

a) n b) n+1 c) n-1 d) n-2

24) In a graph G, the distance from a vertex v to the vertex farthest from v is _____
a) eccentricity of v b) degree of v c) distance of v d) shortest path of v

25) In a connected graph G, the distance between two of its vertices is the length of the _____

a) tree b) shortest path c) longest path d) farthest vertex

26) A non pendant vertex in a tree is called _____

a) a terminal vertex b) an internal vertex c) an external vertex d) a chord

27) With respect to any of its spanning trees a connected graph of n vertices and n-1 edges has ___ chords

a) e-n+1 b) n-1 c) e+1 d) n

28) In a disconnected graph with n vertices and k components then the rank r is ______

a) k-n b) n-k c) e-n d) n-1

29) In a graph G, a vertex with minimum eccentricity is called a _______

a) center b) diameter c) length d) width

30) In any graph G, rank + nullity = ____ in G

a) no. of vertices b) no. of chords c) no. of edges d) no. of branches

31) In a tree T, there is one and only ______ between every pair of vertices

a) path b) vertex c) edge d) component

32) A graph G is a ____ if there is a real number associated with each edge of G.

a) weighted graph b) null graph c) digraph d) directed graph

33) The number of branches in any spanning tree of a graph G is _____ of G

a) rank b) nullity c) chord d) degree

34) The number of chords in any spanning tree of a graph G is _____ of G

a) rank b) nullity c) branch d) degree

35) A connected graph G is a tree iff adding an edge between any two vertices in G creates exactly one __

a) path b) trail c) circuit d) component

36) A tree T with eight edges has ____ vertices

a) 7 b) 6 c) 9 d) 10

37) A tree in which one vertex is distinguished from all the others is called a _____

a) min tree b) rooted tree c) null tree d) spanning tree

38) In every _______, there are one or two centers

a) graph b) tree c) Hamilton graph d) Euler graph

39) The number of vertices in a binary tree is always ______

a) even b) odd c) 2 d) n/2

40) In a graph G, a vertex with maximum eccentricity is called a _______

a) center b) diameter c) length d) width

UNIT – 3

41) Spanning tree is otherwise called as ______

a) skeleton tree b) binary tree c) co tree d) rooted tree

42) With respect to any of its ____, a connected graph with n vertices and e edges has e-n-1 chords

a) co tree b) sub graph c) spanning tree d) tree

43) A circuit formed by adding any one chord to a spanning tree T of a connected graph G is called_____

a) common circuit b) first circuit c) primary circuit d) fundamental circuit

44) A cut set always cuts a graph in to _____ subgraphs

a) 3 b) 2 c) 1 d) 4

45) The removal of cut set reduces the rank of the graph by _____

a) 1 b) 2 c) 3 d) 4

46) Every edge of a tree is a ____

a) cut set b) branch c) chord d) circuit

47) In a connected graph G, any minimal set of edges containing at least one branch of every spanning

tree of G is a _____

a) cut set b) branch c) chord d) none of these

48) Every circuit has an ____ number of edges in common with any cutset

a) odd b) even c) both (a) & (b) d) none of these

49) Every cut set in a connected graph G must contain ___ one branch of every spanning tree in G

a) exactly b) at least c) at most d) none of these

50) Every branch of a spanning tree defines a unique _____

a) fundamental circuit b) fundamental cut set c) fundamental branch d) path

51) The ring sum of any two cutest in a graph is either a third cut set in a graph is either a third cut set or

an edge disjoint ____ of cut sets

a) union b) intersection c) branch d) ring sum

52) A set of edges whose removal from G leaves G disconnected is _____

a) cut set b) branch c) chord d) cut vertex

53) No proper subset of a cut set can be a _____

a) branch b) cut set c) chord d) cycle

54) A cut set is also called a ______

a) proper cut set b) co cycle c) minimal cut set d) all the above

55) A circuit formed by adding any one chord to spanning tree T of a connected graph G is called ____

a) common circuit b) first circuit c) primary circuit d) fundamental circuit

56) If the vertex set V is partitioned in to the vertex sets v1 and v2 then

a) v1 ∪ v2 b) v1 ∩ v2 c) both (a) and (b) d) none of these

57) The _____ between the spanning trees of a graph is a metric

a) cycle b) metric c) distance d) tree

58) The distance between the spanning trees of a graph is a _______

a) cycle b) metric c) distance d) tree

59) Starting from any _____ of a graph G, we can obtain every spanning tree of G by successive cyclic

exchanges

a) tree b) co tree c) cycle d) spanning tree

60) Central tree is denoted by___

a) T0 b) T1 c) T2 d) t2

UNIT – 4

61) Every chord of a spanning tree defines a unique ______

a) fundamental circuit b) fundamental branch c) fundamental cut set d) path

62) If T is a spanning tree of a connected graph G, then a cut set ‘S’ containing exactly one branch of a

tree T is called a_____

a) fundamental circuit b) fundamental cut set c) fundamental branch d) path

63) Every branch of any spanning tree has a ______ associated with it

a) fundamental circuit b) fundamental cut set c) fundamental branch d) path

64) The cut set with minimum number of edges is defined as the _______

a) edge set b) degree of a vertex c) edge connectivity of G d) none of these

65) The minimum number of vertices whose removal from G leaves the remaining graph disconnected is

called ______

a) vertex connectivity b) vertex set c) edge set d) none of these

66) The connectivity of a graph G cannot exceed the degree of a vertex with the smallest degree in G

a) vertex b) edge c) chord d) none of these

67) The ____ connectivity of any graph G can never exceed the edge connectivity of G

a) vertex b) edge c) chord d) none of these

68) A graph G is said to be k-connected if the vertex connectivity of G is _______

a) k b) k-1 c) k+1 d) k+2

69) Every cut set in a non separable graph with more than two vertices contains at least ____ edges

a) 2 b) 3 c) 4 d) 5

70) A vertex V in a connected graph G is a cut set iff there exist two vertices x and y in G such that every

______ between x and y passes through V.

a) walk b) path c) circuit d) none of these

71) The maximum vertex connectivity one can achieve with a graph G of ‘n’ vertices and ‘e’ edges

(e ≥ n-1) is the integral part of the number

a) e/n b) 2/n c) 2e/n d) 2e

72) In a separable graph a vertex whose removal disconnects the graph is called a ________

a) cut set b) cut vertex c) cut edge d) path

73) A graph G is said to be _____ if there exists some geometric representation of G which can be drawn

on a plane such that no two of its edges intersect

a) planar b) embedding c) non planar d) dual

74) A graph that cannot be drawn on a place without a cross over between the edges is called _____

a) planar b) embedding c) non planar d) dual

75) A geometric graph G is planar if there exists a graph _____ to G that is embedded in a plane

a) isomorphic b) non isomorphic c) embedding d) non planar

76) Which of the following are Kuratowski’s two graphs ?

a) K3 & K5 b) K3 & K55 c) K33 & K5 d) none of these

77) A complete graph with ___ vertices is the first of the two graphs of Kuratowski

a) 3 b) 6 c) 10 d) 5

78) The second graph of Kuratowski is a______ connected graph with six vertices and nine edges

a) regular b) complete c) irregular d) trivial

79) The complete graph of five vertices is _____

a) planar b) embedded c) non planar d) isomorphic

80) A plane representation of a graph divides the plane in to _____

a)two b) regions c) embedding d) unbounded meshes

UNIT – 5

81) The incident matrix contains only ___

a) 0,1&2 b) 0&1 c) 0&2 d) 1&2

82) The number of 1’s in each row of the incidence matrix equals the degree of the corresponding______

a) vertex b) edge c) isolated vertex d) pendant vertex

83) A row with all zero’s in the incidence matrix of Graph G represent ______

a) a pendant vertex b) an isolated vertex c) a pendant edge d) an isolated edge

84) Parallel edges in a graph produce ______ columns in its incidence matrix

a) identical b) different c) 2 d) 4
85) Each _____ in a incident matrix A(G) may be regarded as a vector in the vector space of graph G
a) column b) row c) edge d) vertex

86) The rank of the incidence matrix of a connected Graph G with n vertices is _____
a) n-1 b) n c) n+1 d) 2n

87) The rank of the incidence matrix of a ________Graph G with n vertices is n-1

a) connected b) complete c) regular d) simple

88) The reduced incidence matrix of a tree with n vertices and n-1 edges is a _________ matrix of order
and rank n-1

a) row b) column c) square d) none of these

89) In the circuit matrix a column of all zero’s corresponds to a ______ edge

a) non circuit b) circuit c) zero d) pendant

90) Each row of a circuit matrix is a ________

a) circuit vector b) vertex vector c) edge vector d) none of these

91) The number of 1’s in a row of circuit matrix is equal to the number of__ in the corresponding circuit

a) edges b) vertices c) loops d) incidence

92) Two graphs G1 and G2 will have the same circuit matrix if and only if G1 and G2 are _______

a) 1- isomorphic b) 2- isomorphic c) 3- isomorphic d) 0- isomorphic

93) If A and B are respectively the circuit matrix and the incidence matrix whose column are arranged
using the same order of edges then _____= 0(mod2), where super script T denotes the transposed matrix

a) A.BT = BT.A b) A.BT = B.AT c) A.BT = AT.A d) A.BT = A.B

94) The sub matrix of a circuit matrix in which all rows corresponds to a set of fundamental circuits is
called a _______
a) circuit matrix Bf b) fundamental matrix Bf c) fundamental circuit matrix Bf d) none of these

95) If B is a circuit matrix of a connected graph G with e edges and n vertices then the rank of B =______
a) e+n-1 b) e-n-1 c) e-n+1 d) n-e+1

96) A permutation of row or columns in a cut set matrix corresponds to a remaining of the _____ and
edges respectively

a) cut vertex b) cut sets c) cut matrix d) cut edges

97) Each _____ in cut set matrix is a cut set vector

a) row b) column c) edge d) vertex

98) In cut set matrix of graph G, a column with all _____ corresponds to an edge forming a self loop

a) 0’s b) 1’s c) 2’s d) 3’s

99) Parallel edges produce _____ columns in the cut set matrix

a) identical b) different c) 0 d) 3

100) The rank of cut set matrix C(G) is _____ the rank of the incidence matrix A(G), which equals the

rank of graph G

a) equal to b) less than c) greater than d) not equal to

 GRAPH THEORY: B.Sc., MATHEMATICS

SUB. CODE: 17UMA6C16

ANSWER KEY

Unit - 1 Unit -2 Unit - 3 Unit - 4 Unit - 5

S.No Answer S.No Answer S.No Answer S.No Answer S.No Answer
1 C 21 B 41 A 61 A 81 B
2 C 22 B 42 C 62 B 82 A
3 B 23 C 43 D 63 B 83 B
4 D 24 A 44 B 64 C 84 A
5 C 25 B 45 A 65 A 85 B
6 A 26 B 46 A 66 B 86 A
7 B 27 A 47 A 67 A 87 A
8 B 28 B 48 B 68 A 88 C
9 C 29 A 49 B 69 A 89 A
10 B 30 C 50 B 70 B 90 A
11 A 31 A 51 A 71 C 91 A
12 C 32 A 52 A 72 B 92 B
13 B 33 A 53 B 73 A 93 B
14 B 34 B 54 D 74 C 94 C
15 B 35 C 55 D 75 A 95 C
16 A 36 C 56 C 76 C 96 B
17 B 37 B 57 C 77 D 97 A
18 D 38 B 58 B 78 A 98 A
19 B 39 B 59 D 79 C 99 A
20 D 40 B 60 A 80 B 100 A