## G-parking functions, acyclic orientations and spanning trees

- Brian Benson, Deeparnab Chakrabarty, Prasad Tetali
- Discrete Mathematics
- 2010

A. Given an undirected graph G = (V, E), and a designated vertex q ∈ V , the notion of a G-parking function (with respect to q) has recently been developed and studied by various authors. This notion generalizes the classical notion of a parking function associated with the complete graph. In this work, we study properties of certain maximum G… (More)

Sorry, we couldn't extract any figures or tables for this paper.