Oriented graph

One definition of an oriented graph is that it is a directed graph in which at most one of (''x'', ''y'') and (''y'', ''x'') may be edges of the graph. That is, it is a directed graph that can be formed as an orientation of an undirected (simple) graph.

Some authors use "oriented graph" to mean the same as "directed graph". Some authors use "oriented graph" to mean any orientation of a given undirected graph or multigraph.

Regular graph

1.Previous
3.Next