We can abstract the traffic network into a

directed graph G = <V,E> constituted by a set of vertices V and a set of directed edges E, which can be looked as intersections and roads respectively.

Let us now consider another potential way to define the

directed graph [GAMMA]Q.

To get XML Schema, first according to relational database system to solve relational mode and then reconstruct

directed graph, the mapping of the mapping structure which is generated by

directed graph and the

directed graph is XML Schema.

The fact that the edge connecting node A to node B with no requirement for feedback is the reason for application of

directed graph in developing automation for management processes, since in description, analysis and synthesis of automation for process management feedbackis not always necessary.

The structured system (A, B) can be described by a

directed graph (Lin [9]).

The

directed graph makes the basis for building a Markov chain, so all the graph's structural properties are characteristic to Markov chain that can be created on its basis.

Throughout this section, we assume that (X, m) is a multiplicative metric space and G = (V, E) is a

directed graph such that V = X, {(x, x): x E V } E and G has no parallel edges.

A Neutrosophic Cognitive Map is a neutrosophic

directed graph with concepts like policies, events etc.

2 Neutrosophic

directed graph: A neutrosophic

directed graph is a

directed graph which has at least one edge to be indeterminacy.

An artificial neural network (ANN) can be defined as a

directed graph with the following restrictions: The nodes are called processing elements (PE) [37].

A

directed graph or digraph G consists of a set V of vertices and a set E of edges such that e [member of] E, if each edge of the graph G has a direction.

Recall that G(n) denotes the

directed graph of overlapping permutations, that is, it has the vertex set [[?