MAT110U
MATHEMATICS II
7. Ünite
Soru 1
Let G be a graph on 6 vertices with degrees 1,2, 2, 2, 2,5. What is the number of edges of G?
Soru 2
In the following graph, what is the largest vertex degree?
Soru 3
Which one of the following is the set of all neighbours of the vertex a?
Soru 4
Which one of the following cannot be the sequence of degrees of the vertices of a graph?
Soru 5
Which one is the Eulerian walk in the following graph?
Soru 6
I. G is plane diagram
II. G is connected.
III. G has n+1 vertices.
Let G be a tree with n edges. Which of the above statements are true?
Soru 7
Which of the following graphs is not planar?
Soru 8
What is the weight of the given graph?
Soru 9
Soru 10
Plane diagram of a connected planar graph has 5 vertices and 4 regions. What is the number of edges of the graph?
Soru 11
A planar graph has 3 vertices and 6 edges. What is the number of regions of the graph?
Soru 12
I. 1, 2, 3, 4, 4
II. 2, 3, 2, 5, 2
III. 1, 5, 4, 1, 2
IV. 5, 5, 5, 5, 5
V. 3, 2, 3, 1, 2
How many of the above can be the sequence of degrees of vertices of a graph?
Soru 13
A planar graph has 8 regions and 2 vertices. What is the number of edges of the graph?
Soru 14
In the following graph, how many of the vertices have degree 3?
Soru 15
How many vertices are neighbours of the vertex x in the following graph?
Soru 16
At least how many different colors are needed to color each vertex of the given graph below so that adjacent vertices have different colors?
Soru 17
What is the weight of the graph shown below?
Soru 18
How many different trees are there with 4 edges?
Soru 19
Let G be a graph on 5 vertices with degrees 3, 1, 2, 4, 2. What is the number of edges of G?
Soru 20
Which one is an Eulerian walk in the following graph?
