  In this paper, we extend the ideas of graph pebbling to oriented graphs and
find a classification for all graphs with fully traversable pebbling
assignments that are isomorphic to their assignment graph. We then give some
cases in which a graph with a non-fully traversable pebbling assignment is
isomorphic to its assignment graph.
