Asefa, Samuel (PhD)Suleiman, Medina2021-02-242023-11-042021-02-242023-11-042020-11-26http://etd.aau.edu.et/handle/123456789/25213A Parking function is a sequence of positive integers (a1; a2; : : : ; an) such that its non-decreasing rearrangement (b1; b2; : : : ; bn), satis es bi i, for all index i. In this thesis we will see about parking functions and their interrelation with other combinatorial objects; namely non-crossing partitions and labelled trees. We also discuss on the generalization of parking functions namely; G- parking functions and establish a new relationship between parking functions and spanning trees of complete bipartite graphs.enParking FunctionsComplete BipartiteGraphsThesis