On the Assignment Graphs of Oriented Graphs
Combinatorics
2022-03-02 v5
Abstract
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.
Keywords
Cite
@article{arxiv.2111.04882,
title = {On the Assignment Graphs of Oriented Graphs},
author = {Jared Glassband and Garrison Koch and Sophia Lebiere and Xufei Liu and Evan Sabini},
journal= {arXiv preprint arXiv:2111.04882},
year = {2022}
}