Graphical parking functions, or G-parking functions, are a generalization of classical parking functions that depend on a connected multigraph G with a distinguished root vertex. Gaydarov and Hopkins established a connection between G-parking functions and a vector-dependent generalization of parking functions known as u-parking functions. The central component of their result was the classification of all graphs G for which the set of G-parking functions is invariant under the action of the symmetric group \({\frak{S}}_{n}\) , where n + 1 is the order of G. In this work, we present a higher dimensional analogue of Gaydarov and Hopkins’ results by characterizing the intersection between G-parking functions and 2-dimensional U-parking functions, which are pairs of integer sequences whose order statistics are bounded by certain weights along lattice paths in the plane. Our key result is a complete characterization of all G for which the set of G-parking functions is invariant under the action of \({\frak{S}}_{p}\times{\frak{S}}_{q}\) , where p + q +1 is the order of G.
