MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is there a difference or is it just terminology? Thanks.

share|cite|improve this question
Just figured that the authors are French. In french an undirected graph is called "un graphe non orienté". This is a strong - but I'm still unsure. – Lonforce Mar 1 '13 at 14:31
1 explains a difference in use between the two terminologies. I'm not convinced that this is standard, but perhaps a graph theorist can weigh in on the issue. – Lee Mosher Mar 1 '13 at 15:54
up vote 2 down vote accepted

Many people consider that an "oriented graph" is what you get from a simple undirected graph when you assign a direction to each edge. The difference between that and "directed graph" is that a directed graph can have cycles of length 2 even if it is qualified as "simple", whereas an "oriented graph" cannot. On the other hand, there are zillions of papers that use "oriented graph" with identical meaning to "directed graph".

Applying these meanings pedantically in the negative doesn't seem to be a good idea. I'd be very surprised to see anyone using "non-oriented" of a digraph to imply that it doesn't have 2-cycles. I only recall "non-oriented" meaning that the edges don't have directions, which is the same as "undirected".

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.