Free Printable Graph Theory

1.

The degree of any vertex of graph is .... ?

a)

The number of edges incident with vertex

b)

Number of vertex in a graph

c)

Number of vertices adjacent to that vertex

d)

Number of edges in a graph

2.

Is the given Graph is regular?

a)

Yes

b)

No

3.

Which type of graph has all the vertex of the first set connected to all the vertex of the second set?

a)

Regular Graph

b)

Wheel

c)

Bipartite Graph

d)

Complete Bipartite Graph

4.

Which of the following is a correct representation of a complete bipartite graph?

a)

K_2,2

b)

K₄

c)

K₅

d)

C₃

5.

What is the number of edges present in a cycle having n vertices?

a)

n+1

b)

2n

c)

n/2

d)

n

6.

What is the degree of vertex 4?

a)

3

b)

4

c)

5

d)

7

7.

Tracing all edges on a figure without picking up your pencil or repeating edges and starting and finishing at the same vertex is an example of an ...

a)

Euler Circuit

b)

Euler Path

8.

Which statement best describes the graph.

a)

Complete, Planar and Eulerian

b)

Complete and Planar

c)

Complete and Eulerian

d)

Planar and Eulerian

9.

Which of the following is an example of a K₃ graph?

a)

b)

c)

d)

10.

A simple graph ...

a)

has no edges

b)

no loops

c)

no multiple edges

d)

no loops nor multiple edges

11.

The Number of components in the Petersen graph is

a)

1

b)

2

c)

10

d)

15

12.

The line connectivity of a disconnected graph is ____

a)

1

b)

2

c)

0

d)

5

13.

Number of edges of a tree of vertices 10 is………..

a)

10

b)

11

c)

9

d)

5

14.

Which of the following is non-planar?

a)

$K_5$

b)

$K_3$

c)

$K_2$

d)

$K_{3,2}$

15.

The graph $K_{m,n}$ $\left(m<n\right)$ is a .......

a)

Hamiltonian

b)

non- hamiltonian

c)

eulerian

d)

Theta graph

16.

In a graph G, degree of an end point is ………..

a)

1

b)

0

c)

6

d)

5

17.

If δ = 8 for a regular graph, then ∆ = …………

a)

7

b)

9

c)

8

d)

6

18.

The maximum degree of any point in a graph with p points is ……….

a)

p

b)

$p-1$

c)

$p+1$

d)

$p+2$

19.

The minimum number of planar subgraphs is called…………

a)

crossing number

b)

thickness

c)

crossing and thickness

d)

neither crossing number nor thickness

20.

The thickness of a planar graph is …………..

a)

2

b)

1

c)

0

d)

3

21.

Each plane graph has exactly one unbounded face called …………..

a)

exterior face

b)

interior face

c)

segments

d)

boundary

22.

Every uniquely n- colourable graph is ………….. connected.

a)

$\left(n\right)$

b)

$\left(n-1\right)$

c)

$\left(n+1\right)$

d)

$\left(n+2\right)$

23.

A digraph D is called functional if every point has outdegree

a)

0

b)

1

c)

2

d)

3

24.

A digraph is called ……………… connected if the underlying graph is connected.

a)

strongly

b)

disconnected

c)

unilaterally

d)

weakly

25.

Which edge is considered a bridge?

a)

AB

b)

BC

c)

CD

d)

BE

Graph Theory

Total questions: 25

Worksheet time: 30mins

Similar Resources on Wayground