Show simple item record

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.identifier.citationKing, W., & Yan, C. H. (2020). Parking functions on directed graphs and some directed trees. The Electronic Journal of Combinatorics, 27(2).en_US
dc.identifier.issn1077-8926
dc.identifier.urihttps://digital.library.txstate.edu/handle/10877/12145
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.en_US
dc.formatText
dc.format.extent15 pages
dc.format.medium1 file (.pdf)
dc.language.isoen_USen_US
dc.sourceThe Electronic Journal of Combinatorics, 2020, Vol. 27, No. 2.
dc.subjectParking functions
dc.subjectMapping digraphs
dc.subjectEdge orientations
dc.titleParking Functions on Directed Graphs and Some Directed Treesen_US
txstate.documenttypeArticle
dc.rights.holder© The authors.
dc.identifier.doihttps://doi.org/10.37236/9051
dc.rights.licenseReleased under the CC BY-ND license (International 4.0).
txstate.departmentMathematics


Download

Thumbnail

This item appears in the following Collection(s)

Show simple item record