Parking Functions on Directed Graphs and Some Directed Trees

dc.contributor.authorKing, Westin
dc.contributor.authorYan, Catherine H.
dc.date.accessioned2020-07-22T19:13:03Z
dc.date.available2020-07-22T19:13:03Z
dc.date.issued2020-06
dc.description.abstractClassical parking functions can be defined in terms of drivers with preferred parking spaces searching a linear parking lot for an open parking spot. We may consider this linear parking lot as a collection of n vertices (parking spots) arranged in a directed path. We generalize this notion to allow for more complicated “parking lots” and define parking functions on arbitrary directed graphs. We then consider a relationship proved by Lackner and Panholzer between parking functions on trees and “mapping digraphs” and we show that a similar relationship holds when edge orientations are reversed.
dc.description.departmentMathematics
dc.formatText
dc.format.extent15 pages
dc.format.medium1 file (.pdf)
dc.identifier.citationKing, W., & Yan, C. H. (2020). Parking functions on directed graphs and some directed trees. The Electronic Journal of Combinatorics, 27(2).
dc.identifier.doihttps://doi.org/10.37236/9051
dc.identifier.issn1077-8926
dc.identifier.urihttps://hdl.handle.net/10877/12145
dc.language.isoen
dc.rights.holder© The Author(s).
dc.rights.licenseThis work is licensed under a Creative Commons Attribution 4.0 International License.
dc.sourceThe Electronic Journal of Combinatorics, 2020, Vol. 27, No. 2.
dc.subjectparking functions
dc.subjectmapping digraphs
dc.subjectedge orientations
dc.subjectMathematics
dc.titleParking Functions on Directed Graphs and Some Directed Trees
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
9051-PDF file-32295-1-10-20200604.pdf
Size:
312.94 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.54 KB
Format:
Item-specific license agreed upon to submission
Description: