odd

even

multiple of 4

none of these

${\mathrm{d}}^{+}\left(\mathrm{v}\right)$

${\mathrm{d}}^{-}\left(\mathrm{v}\right)$

$\mathrm{d}\left(\mathrm{v}\right)$

$\mathrm{D}\left(\mathrm{v}\right)$

both has same number of vertices

both has same number of edges

A and B only

none of these

0

1

2

none of these

edges of a path

vertices of a path

direction of a path

degree of vertices of path

The number of edges appearing in the sequence of a path is called the length of the path.

Every elementary path of a digraph is also a simple path.

A path which originates and ends with the same vertex is called a cycle.

Every simple path of a digraph is also a elementary path.

A vertex v of a simple digraph is said to be reachable from the vertex u of the same digraph if there is at least one path from u to v.

If a vertex v is a reachable from the vertex u then a path of minimum length from u to v is called a geodesic.

$\mathrm{\delta }=\underset{\mathrm{u}, \mathrm{v}\in \mathrm{V}}{\min }\mathrm{d}(\mathrm{u}, \mathrm{v})$

The length of a geodesic from the vertex u to the vertex v is called the distance.