Graph Theory 1

Question 1

If the origin and terminus of a walk are the same, then walk is known as which of the following?

Answer 1

Closed

Question 2

Length of the walk of a graph is:

Answer 2

The number of vertices in walk W

Question 3

Two graphs are said to be ___________ if there is a bijection between their vertex sets that preserves incidence relations.

Answer 3

Isomorphic graph

Question 4

Which among the following is the degree of any vertex of the graph?

Answer 4

The number of edges incident with vertex

Question 5

In which of the following a walk in which all the edges but not necessarily all the vertices are different?

Answer 5

Trail

Question 6

Which among the following graphs include edges that connect a vertex to it?

Answer 6

Loop

Question 7

A partial set of relation is transitive, reflexive and ___________ .

Answer 7

Antisymmetric

Question 8

The City–Route Puzzle is also known as:

Answer 8

Konigsberg bridge problem

Question 9

A graph is a collection of which of the following?

Answer 9

Vertices and edges

Question 10

Which of these is a connected graph if it contains a cycle that includes every vertex?

Answer 10

Hamiltonian graph