Graph Theory 2

Question 1

Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to_______.

Answer 1

6

Question 2

How many vertices does are regular graph of degree 4 with 10 edges have?

Answer 2

5

Question 3

A graph is a tree if and only if:

Answer 3

It is minimal

Question 4

Which of the following graphs is Komplete graph?

Answer 4

Kn

Question 5

The number of leaf nodes in a complete binary tree of depth d is _______.

Answer 5

2d

Question 6

The number of colours required to properly colour the vertices of every planar graph is

Answer 6

5

Question 7

In an undirected graph, the sum of degree of all the nodes:

Answer 7

Twice the number of edges

Question 8

Suppose v is an isolated vertex in a graph, then the degree of v is:

Answer 8

0

Question 9

A graph with no edges is known as empty graph. Empty graph is also known as _______.

Answer 9

Null Graph