1.

The Handshaking Lemma is also called as _________ theorem

a) Gauss
b) Euler’s
c) Dirac's
d) Jacobi's

2. A graph may have odd vertices of even degree.

a) True
b) False

3. A graph must always have an even number of vertices.

a) False
b) True

4. Which among the following graphs has (5,5,5,5,6,6,6,6,6) as its degree

sequence?
a) complete bipartite graph with 5 and 6 partite sets
b) there exists no such simple graph
c) 5-cube
d) 11-cube

5. The graph Km,n has size

a) mn
b) m+n
c) 2mn
d) m-n

6. There exists a graph with degree sequence (4,2,2,2).

a) True
b) False

7. _________ of a vertex is the number of edges incident at that vertex.

a) Size
b) Regularity
c) Degree
d) Order

8. The cardinality of the number of vertices of a graph is called its _________.

a) Regularity
b) Order
c) Degree
d) Size
9. Two vertices of a simple graph may have the same degree.
a) False
b) True

10. The cardinality of the number of edges of a graph is called its _________.
a) Degree
b) Size
c) Regularity
d) Order

11. A graph with degree sequence (d,d,d,...,d) of order d+1 is __________.

a) complete graph
b) complete bipartite
c) Hypercube
d) Petersen graph
12. Fact I : There exists a simple graph with degree sequence (3,2,1,0) Fact II :
There exists a simple graph with degree sequence (3,3,3,3,3) .
a) Both facts are true
b) Fact II is alone true
c) Neither facts are true
d) Fact I alone is true

13. An edge whose end vertices are same is called as _________

a) link
b) loop
c) directed arc
d) node

14. The order of the hypercube Qk is

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

15. A graph whose vertices all have the same degree is called as
_____________ graph.
a) regular
b) complete bipartite
c) simple
d) Complete
16. The order, size and regularity of Petersen graph is ____, ____, and ____
respectively.
a) 10, 15, 3
b) 3, 10, 15
c) 15, 10, 3
d) 3, 15, 10

17. How many odd degree vertices are there in K5,6?

a) 30
b) 11
c) 6
d) 5

18. The incidence function of a graph is defined by ________.

a) V --> E x E
b) V x V --> E
c) E x E --> V
d) E --> V x V

19. Identify the properties of a sequence of integers to be graphic. Fact I : it is

non-increasing Fact II : there are an odd number of even degree vertices
in it
a) Fact II alone holds
b) Both facts are true
c) Neither facts are true
d) Fact I alone holds

20. The graph Kn has size

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

21. For a graph with order m and size n, the sum of degrees of all its vertices
is equal to
a) 2m
b) m+n
c) mn
d) 2n

22. θ(e) = ψ Let θ : V1 → V2 and ψ : E1 → E2 . Then for an edge e=(u,v)

according to isomorphism,
a) ψ(e) = (θ(u), θ(v))
b) ψ(e) = θ(u, v)
c) θ(e) = ψ(u, v)
d) θ(e) = (ψ(u), ψ(v))

23. The size of hypercube Q3 is

a) 12
b) 16
c) 4
d) 8

24. How many odd degree vertices are there in K9?

a) 2
b) 9
c) 4
d) 0

25. An isomorphism is ____________.

a) incidence preserving mapping
b) adjacency preserving bijective mapping
c) adjacency preserving injective mapping
d) incidence preserving bijective mapping

1. State true or false : Every tree graph is eulerian.

a) True
b) False

2. Which of the following graphs is non-hamiltonian?

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

3. A forest is a
a) acyclic graph
b) connected cyclic graph
c) connected acyclic graph
d) connected graph
4. In a tree, there always exist exactly ________ paths between any pair of
vertices.
a) 0
b) 3
c) 2
d) 1

5. Identify the properties of a sequence of integers to be graphic. Fact I : it is

non-increasing Fact II : there are an odd number of even degree vertices
in it
a) Both facts are true
b) Fact II alone holds
c) Fact I alone holds
d) Neither facts are true

6. State true or false : There exists a graph which is both a tree and is also
complete bipartite.
a) True
b) False

7. A trail is
a) path with distinct vertices
b) path with distinct edges
c) walk with distinct edges
d) walk with distinct vertices

8. Determine whether the following graphs isomorphic or not?

a) A only
b) Both are isomorphic
c) B only
d) Both are non-isomorphic
9. Which of the following graphs is neither eulerian nor hamiltonian?

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

10. Which among the following graphs has (5,5,5,5,6,6,6,6,6) as its degree
sequence?
a) complete bipartite graph with 5 and 6 partite sets
b) there exists no such simple graph
c) 5-cube
d) 11-cube
11. Fact I : A path is always a tree. Fact II : A path is a trail with distinct
vertices
a) Fact II is alone true
b) Fact I is alone true
c) Neither facts are true
d) Both facts are true

12. Which among the following is hamiltonian?

a) complete bipartite graph with |X| = 5 and |Y|=2
b) complete bipartite graph with |X| = 5 and |Y|=1
c) petersen graph
d) complete graph of order 6

13. An adjacency matrix is always both _________ and _________.

a) rectangular ; symmetric
b) square ; non-symmetric
c) square ; symmetric
d) rectangular ; non-symmetric

14. The incidence function of a graph is defined by ________.

a) E --> V x V
b) E x E --> V
c) V --> E x E
d) V x V --> E
15. For a complete graph with order 20, its size is
a) 195
b) 180
c) 200
d) 190

16. How many distinct trees of order 6 are there?

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

17. Fact I : There exists a simple graph with degree sequence (3,2,1,0) Fact
II :There exists a simple graph with degree sequence (3,3,3,3,3)
a) Fact I alone is true
b) Neither facts are true
c) Both facts are true
d) Fact II is alone true

18. State true or false : No tree is hamiltonian.

a) False
b) True

19. Which among the following is not a property of the adjacency matrix of
asimple graph?
a) it is a symmetric matrixits
b) column sum is always equal to its degree
c) some diagonal entries may be non-zeroit
d) is a binary matrix

20. A graph with degree sequence (d,d,d,...,d) of order d+1 is __________.

a) Complete bipatrite
b) Complete graph
c) Hypercube
d) Petersen graph

21. The (1,3) entry of the cube of the adjacency matrix of a graph denotes
a) the number of trails between v1 and v3 of length 3
b) the number of edges between v1 and v3
c) the number of walks between v1 and v3 of length 3
d) the number of paths between v1 and v3 of length 3
22. Which among the following are both eulerian and hamiltonian?

a) Both B and D
b) Both A and D
c) Both A and B
d) Both B and C

23. Each column sum of an incidence matrix is

a) Equal to the order of the graph
b) Always 2
c) Equal to the size of the graph
d) Equal to the degree of the particular vertex

24. What is the maximum possible size of a simple graph of order 5?

a) 20
b) 5
c) 15
d) 10

25. A graph is non-eulerian if and only if

a) it has atleast one vertex of even degree
b) it has exactly two vertices of even degree
c) it has atleast one vertex of odd degree
d) it has exactly two vertices of degree one
Model
PDF

1. The Function associated with defining a graph is _______ function.

a. Incidence b. Adjacent c. Degree d. Distance

2. Two edges which are incident with a common vertex are called _____

a. Incident b. Adjacent c. Neighbour d. Multiple edge

3. Determine the member of simple non-isomorphic graphs of order four?

a. Five b. Six c. Ten d. Eleven

4. The ring of a simple bipartite graph is at most _________.

𝛾2 𝛾2
a. 𝛾 b. 𝛾 2 c. d.
2 4

5. The incidence matrix will be square if the corresponding graph is ___

a. Tree b. Forest c. Cycle d. Complete

6. The order of a self-complementary graph is ___

a. 6 b. 10 c. 5 d. 15

7. An isomorphism of a graph onto itself is ______

a. Homomorphism b. Bijection c. Automorphism d. Inverse

8. State T or F: every induced subgraph of a complete graph is complete.

a. True b. False

9. Find the correct Statement.

𝜀 2𝜀
a. 𝛿 ≤ 𝛾 ≤ ∆ b. 𝛿 ≤ 𝜀 ≤ ∆ c. 𝛿 ≤ 𝛾 ≤ ∆ d. . 𝛿 ≤ 𝛾
≤∆

10. Determine which among the following is not graphic?

a. (2,2,2,2) b. (3,3,3,3) c. (5,5,5,4,2,1) d. (5,5,5,5,5,5)

11. A simple graph will connected only if _______

𝛾−1 𝛾−1 𝛾−1 𝛾+1
a. 𝜀 = b. 𝜀 < ( ) c. 𝜀 > ( ) d. 𝜀 =
2 2 2 2

12. If ___________, then G is cyclic.

a. 𝛿 = ∆ b. 𝛿 = 1 c. 𝛿 ≥ 2 d. 𝛿 < 2

13. Which of the following is not a property of a tree?

a. 𝜀 = 𝛾 + 1

b. It is connected

c. It is acyclic

d. It is a connected subgraph of a forest

14. If W(G-e)> 𝑾(𝑮), Then e is _________

a. Loop b. Cut-edge c. Bond d. Parallel-edge

15. A graph contains atleast ___________ distinct cycles.

a. 𝜀 + 𝛾 + 𝑤 b. 𝜀 − 𝛾 − 𝑤 c. 𝜀 − 𝛾 + 𝑤 d. 𝜀 + 𝛾 − 𝑤

16. If (𝑮 𝒐 𝒆) is the edge- contracted graph of G, then which among is not true?

a. 𝛾(𝐺 𝑜 𝑒) = 𝛾(𝐺) − 1 b. 𝑊(𝐺 𝑜 𝑒) = 𝑊(𝐺) − 1

c. 𝜀(𝐺 𝑜 𝑒) = 𝜀(𝐺) − 1 d. If T is tree, then 𝑇 𝑜 𝑒 is also a tree

17. 𝝉(𝑲𝟓 ) =

a. 52 b. 55 c. 53 d. 35

18. The characterisation result of k-connected graphs was given by______

a. Menger b. Whitnry c. Dirac d. Euler

19. T or F : A non-empty connected graph is eulerian if and only if it has no odd cycle .

a. True b. False

20. Fact 1: Dodecahedron is non-Hamiltonian.

Fact 2: Herschel graph is bipartite.

a. Both facts are true. b. Fact 1 is only true

c. Both facts are false d. Fact 2 is only true

21. If G is simple with ________ then G is Hamiltonian.

𝛾 𝛿
a. 𝛾 ≥ 2 𝑎𝑛𝑑 𝛿 ≥ 3 b. 𝛾 ≥ 3 𝑎𝑛𝑑 𝛿 ≥ c. 𝛾 ≥ 3 𝑎𝑛𝑑 𝛾 ≥
2 2

d. 𝛾 ≥ 2 𝑎𝑛𝑑 𝛾𝛿 ≥ 2

22. A simple graph is Hamiltonian if and only if it’s_____ is Hamiltonian.

a. Complement b. spanning subgraph c. Closure

d. Underlying graph

23. The necessary and sufficient conditions for the existence of a maximum matching in G were given by.

a. Berge b. Hall c. Whitney d. Konig

24. A subset of V(G) such that every edge of G has at least one end in it is called _____ of G.

a. Matching b. Perfect matching c. Covering d. factor

25. A characterisation result for existence of a project matching in a graph was given by__.

a. lovasz b. Tutte c. Petersen d. Hall

26. G has a perfect matching iff ______ for all 𝑺 ≤ 𝑽.

a. 𝑜(𝐺 − 𝑆) ≥ |𝑆| b. 𝑜(𝐺 − 𝑆) ≤ |𝐺| c. 𝑜(𝐺 − 𝑆) ≤ |𝑆| d. 𝑜(𝐺 − 𝑆) ≥ |𝐺|

27. Existence of perfect matching in a cubic graph was given by __________.

a. Lovasz b. Tutte c. Petersen d. Hall

28. Every cubic graph without _____ has a perfect matching.

a. Even cycles b. Odd cycles c. Cut edges d. Cut vertices

29. A tree has a perfect matching iff 𝒐 (𝑮 − 𝒗) = ______ ,for all 𝒗𝝐𝑽 .

a. o b. 1 c. 2 d. 3

30. The edge-chromatic number of a bipartite graph is ______.

a. 𝛿 𝑏. 𝜀 𝑐. 𝛾 𝑑. ∆

31. G is bipartite if and only if ______, for all 𝑯 ⊆ 𝑮 such that 𝜸(𝑯) > 𝟎.

a. 𝛼(𝐻) = 𝛽 ′ (𝐻) b. 𝛼(𝐻) = 𝛾(𝐻) c. 𝛽(𝐻) = 𝛼 ′ (𝐻) d. 𝛽(𝐻) = 𝛾(𝐻)

32. A subset of V(G) whose induced subgraph is complete is called ________ of G.

a. Matching b. Covering c. Clique d. Block

33. The ramsey number 𝒓(𝟐, 𝒍) = _______ .

a. 2 b. o c. 𝑙 d. 2 + 𝑙

34. 𝒓(𝒌, 𝟐) = ______.

a.K 𝑏. 2 + 𝑘 𝑐. 2𝑘 𝑑. 𝑘 2

35. According to ramsey’s theorem if 𝒌 ≥ 𝟐 𝒂𝒏𝒅 𝒍 ≥ 𝟐, then

a. 𝑟(𝑘, 𝑙) ≤ 𝑟(𝑘, 𝑙 − 1) − 𝑟(𝑘 − 1, 𝑙) b. 𝑟(𝑘, 𝑙) ≤ 𝑟(𝑘, 𝑙 − 1) + 𝑟(𝑘 − 1, 𝑙)

c. 𝑟(𝑘, 𝑙) ≤ 𝑟(𝑘, 𝑙 + 1) − 𝑟(𝑘 + 1, 𝑙) d. 𝑟(𝑘, 𝑙) ≤ 𝑟(𝑘, 𝑙 + 1) + 𝑟(𝑘 + 1, 𝑙)
36. Which of the following is true for the cycle graph C5 ?
(A) it is bipartite
(B) it is complete
(C) it contains no … of three vertices
(D) it has a perfect matching

37. r(3,3) =
(A)6
(B)9
(C)14
(D)18

38. r(3,4) =
(A)6
(B)9
(C)14
(D)18

39. r(3,5) =
(A)6
(B)9
(C)14
(D)18

40. r(4,4) =
(A)6
(B)9
(C)14
(D)18

41. which among the following is a 4-critical graph?

(A) Petersen graph
(B) tutle’s graph
(C) Grotzsch graph
(D) Dodecahedron graph
42. If G is 5-critical, then ____
(A) 𝛿 ≥ 1
(B) 𝛿 ≥ 2
(C) 𝛿 ≥ 3
(D) 𝛿 ≥ 4

43. True or False : Every K-Chromatic graph has atleast k vertices of degree atleast k-1
(A) True
(B) False

44. Fact 1 : In a critical graph, every vertex cut is a clique

Fact 2 : Every critical graph is a block.
(A) Fact 1 is true only
(B) Fact 2 is true only
(C) Both facts are true
(D) Both facts are false

45. If any two odd cycles of G have a vertex in common then its chromatic number
(A) 𝜓 ≤ 4
(B) 𝜓 ≥ 4
(C) 𝜓 ≤ 5
(D) 𝜓 ≥ 5

46. If G is bipartite then 𝜓(𝐺) = __

(A) 1
(B) 2
(C) 3
(D) 𝜈

47. Which of the following is true if G is bipartite ?

(A) G has 5 odd cycles if γ(𝐺)=25
(B) G is cyclic
(C) G is complete
(D) G is 2-chromatic

48. If G is empty, then 𝜋𝑘 (𝐺) = __

(A) 0
(B) γ
(C) k
(D) k γ
49. If G is simple then for any edge e of G,
(A) 𝜋𝑘 (𝐺 − 𝑒) = 𝜋𝑘 (𝐺) - 𝜋𝑘 (𝐺 ° e)
(B) 𝜋𝑘 (𝐺 ° 𝑒) = 𝜋𝑘 (𝐺) - 𝜋𝑘 (𝐺-e)
(C) 𝜋𝑘 (𝐺 − 𝑒) = 𝜋𝑘 (𝐺 ° e) - 𝜋𝑘 (𝐺)
(D) 𝜋𝑘 (𝐺 ° 𝑒) = 𝜋𝑘 (𝐺 − 𝑒) - 𝜋𝑘 (𝐺)

50. 𝜋𝑘 (𝐾1,3 ) = _____

(A) k(k − 1)3
(B) k 3 (𝑘 − 1)
(C) k(k + 1)3
(D) k 3 (𝑘 + 1)

51. 𝜋𝑘 (𝐶4 ) = ___

(A) k(k-1)(k-3)
(B) k(k-1)( k 2 − 3𝑘)
(C) k(k-1)( k 2 − 3𝑘 + 3)
(D) k(k-1)( k 2 − 3𝑘 − 3 )

52. If G is a tree, then . 𝜋𝑘 (G) = ____

(A) k(k − 1)3
(B) k(k − 1)γ−1
(C) k(k − 1)γ
(D) k(k − 1)γ+1

53. which among the following is non-planar ?

(A) 𝐾2
(B) 𝐾4
(C) 𝐾5
(D) 𝐾3
54. which among the following is planar ?
(A) 𝐾5
(B) 𝐾3,3
(C) 𝐾5 − 𝑒
(D) 𝐾5 𝑈𝐾3,3

55. Which among the following is non-planar?

(A) 𝐾1,1
(B) 𝐾2,2
(C) 𝐾3,3
(D) 𝐾3,1

56. Each plane graph has exactly _____ unbounded face

(A) 0
(B) 1
(C) 2
(D) ε

57. The formula relating γ ,ε and 𝜙 of a plane graph was given by ___
(A) Harary
(B) Euler
(C) Hall
(D) Tutte
58. If G is a connected plane graph, then
(A) γ - ε + 𝜙 = 2
(B) 𝜙 − γ+ ε = 2
(C) ε- γ + 𝜙 = 2
(D) γ + ε - 𝜙 = 2

59. If G is a simple planar graph of order atleast 3, then

(A) ε ≤ 3
(B) ε ≤ 3 γ
(C) ε ≤ 3 γ + 6
(D) ε ≤ 3 γ − 6

60. The minimum degree of a simple lanar graph is at most ___

(A) 5
(B) 6
(C) 7
(D) 8

61. The five- colour theorem was established by ___

(a) Harary
(B) Vizing
(C) Heawood
(D) Hall
62. The column sum of an incidence matrix is ___
(a) ε
(B) γ
(C) 1
(D) 2

63. The column sum of an adjacency matrix is ____

(A) deg (v)
(B) 2 ε
(C) ε γ
(D) 2

64. State true or false : 𝐶5 is a subgraph of 𝐾5,5

(A) True
(B) False

65. True or false : Every path contains a walk.

(A) True
(B) False
66. Find the correct statement :

(A) K ≤ K′ ≤ 𝛿

(B) 𝑘 ≥ 𝑘 ′ ≥ 𝛿
(C) 𝑘 ′ ≤ 𝑘 ≤ 𝛥
(D) 𝑘 ′ ≤ 𝑘 ≤ 𝛿

67. For the above graph G,

(A) K < K’ < 𝛿

(B) K = K ‘ < 𝛿
(C) K < K ‘= 𝛿
(D) K = K ‘ = 𝛿

68. Fact 1 : Every subgraph of a bipartite graph is bipartite.

Fact 2 : Every subgraph of an eulerian graph is eulerian.
(A) Fact 1 is only true
(B) Fact 2 is only true
(C) Both facts are true
(D) Both facts are false

69. If G is eulerian, then every ___ of G is eulerian?

(A) induced subgraph
(B) block
(C) clique
(D) matching

70. For a graph G of order atleast 3, if its closure C(G) is ____ , then G is Hamiltonian
(A) Complete
(B) block
(C) true
(D) bipartite
(3) A graph with degree sequence (𝑑, 𝑑, 𝑑, … , 𝑑) of order 2𝑑 is
Complete graph
Complete bipartite graph
Hypercube
Petersen graph

(4) Fact I: Every subgraph of a bipartite graph is bipartite.

Fact II : Every complete graph is hamiltonian.
Fact I is only true
Fact II is only true
Both facts are true
Both facts are false

(5) The Ramsey number 𝑟(𝑚, 𝑛) = 6 if

𝑚=𝑛=2
𝑚=𝑛=3
𝑚=𝑛=4
𝑚 = 2 and 𝑛 = 3

(6) Which among the following is a 4 -critical graph?

Petersen graph
Tutte graph
Grotzsch graph
Dodecahedron graph

(7) State true or false : Every subgraph of a complete graph is always

complete.
True
False

(8) The five-colour theorem was established by

Harary
Vizing
Heawood
Petersen

(9) The chromatic polynomial of the star 𝜋𝑘 (𝐾1,3 ) =

𝑘(𝑘 − 1)3
𝑘 3 (𝑘 − 1)
𝑘(𝑘 + 1)3
𝑘 3 (𝑘 + 1)

(10) Which among the following graphs has (4,4,4,4,5,5,5,5,5) as its

degree sequence?
5-cube
9-cube
complete bipartite graph with 4 and 6 partition sets
there exists no such graph

(11) The characterization result for the existence of a maximum

matching in 𝐺 was given by
Berge
Hall
Whitney
Konig

(12) If 𝐺 is a bipartite graph then its chromatic number is

𝟏
2
𝝂
𝝐

)13) If 𝐺 is a simple planar graph of order 𝜈 ≥ 3, then its size is atmost

3𝜈
𝜈3
3𝜈 − 6
3𝜈 + 6

(14) If _______ then 𝐺 is cyclic.

𝛿=Δ
𝛿≥2
Δ≥2
𝛿≥Δ

(15) The number of simple nonisomorphic graphs of order four is

Eight
Nine
Ten
Eleven
(16) Which among the following graphs is NOT both hamiltonian and
eulerian?
𝐾5
𝐶5
𝐾10
𝐶10

(17) Fact I : There exists a simple graph with degree sequence (3,2,1,0)
Fact II : There exists a simple graph with degree sequence (3,3,3,3,3)
Fact I is only true
Fact II is only true
Both facts are true
Neither facts are true

(18) If 𝐺 is eulerian, then every of 𝐺 is eulerian.

subgraph
induced subgraph
matching
clique subgraph

(19) State true or false : Closure of a graph is a well-defined property.

True
False

(20) Fact I : A path is always a tree.

Fact II : A path is a trail with distinct vertices.
Fact 𝐼 is only true
Fact II is only true
Both facts are true
Neither facts are true

(21) State true or false : 𝐶5 is a subgraph of 𝐾5,5

True
False

(22) The Ramsey number 𝑟(3,5) =

6
9
14
18

(23) The number of spanning trees 𝜏(𝐾5 ) =

52
53
35
55

(24) Which of the following is true in a bipartite graph?

Fact I: It is eulerian
Fact II : It is 2-chromatic
Fact I only
Fact II only
Both facts are true
Neither fact is true

(25) Every 𝑘 -chromatic graph has at least vertices of degree at least

𝑘 − 1.
𝑘+1
𝑘
𝑘−1
2𝑘

(26) A subset of 𝑉(𝐺) whose induced subgraph is complete is called of

𝐺.
matching
covering
clique
factor

(27) Which among the following bipartite graphs is non-planar?

𝐾2,2
𝐾3,3
𝐾1,2
𝐾20,1

(28) The column sum of an incidence matrix is

𝜖
𝝂
1
2

(29) The function associated with defining a graph is function.

incidence
adjacent
degree
distance
(30) Find the correct statement:
() 𝜅 ≤ 𝜅 ′ ≤ 𝛿
𝜅′ ≤ 𝜅 ≤ 𝛿
𝜅 ≥ 𝜅′ ≥ 𝛿
𝜅′ ≥ 𝜅 ≥ 𝛿

(31) A simple graph is hamiltonian if and only if its is hamiltonian.

closure
complement
spanning tree
orientation

(32) Which among the following is NOT a property of a tree?

It is connected
It is acyclic
It is a connected subgraph of a forest
𝜈 =𝜖−1

(33) If 𝐺 is an empty graph, then its chromatic polynomial 𝜋𝑘 (𝐺) =

𝑘𝜈
𝜈
𝑘
𝑘𝜈

(34) Suppose 𝐺 ∘ 𝑒 is the edge-contracted graph of 𝐺, then which

among the following is true?
𝜔(𝐺 ∘ 𝑒) = 𝜔(𝐺)
Δ(𝐺 ∘ 𝑒) = Δ(𝐺)
𝜈(𝐺 ∘ 𝑒) = 𝜈(𝐺)
𝜖(𝐺 ∘ 𝑒) = 𝜖(𝐺)
(35) Existence of a perfect matching in a 3 -regular graph was proved by
Petersen
Berge
Tutte
Lovasz

(36) An isomorphism of a graph onto itself is called as

homomorphism
bijection
automorphism
inverse

(37) Each plane graph has exactly unbounded face.

0
1
2
𝜖

(38) An edge 𝑒 of 𝐺 is a cut-edge if

𝜔(𝐺 − 𝑒) = 𝜔(𝐺)
𝜔(𝐺 − 𝑒) < 𝜔(𝐺)
𝜔(𝐺 − 𝑒) > 𝜔(𝐺)
𝜔(𝐺 − 𝑒) = 𝜔(𝐺 + 𝑒)

(39) Determine which among the following sequences is NOT graphic?

(2,2,2,2,2,2,2,2,2,2,2)
(3,3,3,3,3,3,3,3,3,3)
(4,4,4,4,4)
(5,5,5,5,5,5,5,5,5,5,5)

(40) The necessary and sufficient condition for 𝑘 -connected graphs was
established by
Menger
Whitney
Dirac
Euler

(41) A graph contains at least ________distinct cycles.

𝜖+𝜈+𝜔
𝜖−𝜈+𝜔
𝜖+𝜈−𝜔
𝜖−𝜈−𝜔

(42) The size of a simple bipartite graph is at most

𝝂
𝜈2
𝜈2
2
𝜈2
4

(43) A subset of 𝑉(𝐺) such that every edge of 𝐺 has at least one end in
it is called of 𝐺
matching
perfect matching
covering
factor
 (44) If any two odd cycles of 𝐺 have a vertex in common, then its
chromatic number is
at most 4
at least 4
at least 5
at most 5

(45) The minimum degree of a simple planar graph is at most

5
6
7
8

(46) A complete graph is non-planar if its order is

2
3
4
5

(47) State true or false : There exists a self-complementary graph of

order 10.
True
False

(48) Euler’s plane graph formula states that

𝜈−𝜖+𝜙 =2
𝜈+𝜖−𝜙 =2
𝜖+𝜙−𝜈 =2
𝜖−𝜙+𝜈 =2

(49) Fact I: Dodecahedron is non-hamiltonian.

Fact II : Herschel graph is bipartite
Fact I is only true
Fact II is only true
Both facts are true
Both facts are false

(50) Which of the following is true for a complete graph 𝐾9 ?

Fact I: it is hamiltonian
Fact II : it is eulerian
Fact I only
Fact II only
Both facts are true
Both facts are false

(51) A tree 𝐺 has a perfect matching iff 𝑜(𝐺 − 𝑣) = ∀𝑣 ∈ 𝑉

0
1
2
3
(52) The Ramsey number 𝑟(𝑚, 2) =
𝑚
𝑚+2
𝑚−2
𝑚2