Hostname: page-component-7b7567c8c-qbl2m Total loading time: 0 Render date: 2026-11-15T23:03:02.809Z Has data issue: false hasContentIssue false

Which Graphs have only Self-Converse Orientations?

Published online by Cambridge University Press:  20 November 2018

Frank Harary
Affiliation:
University of Michigan and University College, London
Edgar Palmer
Affiliation:
University of Michigan and University College, London
Cedric Smith
Affiliation:
University of Michigan and University College, London
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

An orientation of a graph G is an assignment of a unique direction to each line of G. The result is called an oriented graph. Two orientations of a graph are regarded as equivalent if the resulting oriented graphs are isomorphic as directed graphs. For example, the graph C3 consisting of a cycle of length 3 (a triangle) shown in Figure 1(a), has exactly two orientations D1 and D2; see Figure 1(b) and (c).

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1967