 |
|
Abstract: In this talk we discuss the similarity of oriented graphs by defining a metric in terms of arc reversal and arc rotation on the space of oriented graphs having the same size and order. For a set S of oriented graphs of a fixed order and fixed size, the distance graph of S is the graph with vertex set S such that two vertices G and H are adjacent if and only if the distance between them is one. We will investigate the problem of determining which graphs are distance graphs under this reversal-rotation metric.
