Scribd
Upload
86 views12 pages

Graph Theory Model Exam

(1) The Ramsey number r(m, n) = 6 if m = n = 3. (2) A 4-critical graph is the Grotzsch graph. (3) Every subgraph of a complete graph is not always complete.

Uploaded by

Halet Ismail (RA1932005010001)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
86 views12 pages

Graph Theory Model Exam

(1) The Ramsey number r(m, n) = 6 if m = n = 3. (2) A 4-critical graph is the Grotzsch graph. (3) Every subgraph of a complete graph is not always complete.

Uploaded by

Halet Ismail (RA1932005010001)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

(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

You might also like