# oriented graph

## oriented graph

[′ȯr·ē·ent·əd ′graf]
(mathematics)
A directed graph in which there is no pair of points a and b such that there is both an arc directed from a to b and an arc directed from b to a.
Mentioned in ?
References in periodicals archive ?
It is an oriented graph composed by a vertices and oriented arcs (lines),
Turning back to the general case, for each cumulant, we construct an oriented graph as follows (see Figure 2 for some examples):
This processing is based on construction and analysis of the bundle graph that is a specialized multi-partite oriented graph reflecting features of inter-task synchronizing links.
In this paper, a method aimed at solving the nonsymmetric pressure matrix formed from the RELAP5/MOD3.3 code is proposed based on the oriented graph method.
By convention, the partial order will be decreasing along the edges of the oriented graph [GAMMA]Q.
Keywords: oriented graph, weak diameter, strong diameter, complexity
Definition: 2.3 Neutrosophic oriented graph: A neutrosophic oriented graph refers to a neutrosophic directed graph having no symmetric pair of directed indeterminacy lines.
In non-direction oriented graph, it is possible to move in both directions between the Heads and the order of manes' Head is not important.
Let G be an oriented graph (with the notation established in Table 1) whose edges are denoted by [e.sub.1], ..., [e.sub.m], with the enumeration of the edges being dictated by the incidence matrix.
A composed LO is an acyclic oriented graph where nodes are learning objects, or operators.
+ [D.sub.l] an oriented graph obtained from G by considering strong orientations of all its cycles, where und ([D.sub.i]) = [G.sub.i].

Site: Follow: Share:
Open / Close