(G,m)-multiparking functions

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0


Scientific paper

The conceptions of $G$-parking functions and $G$-multiparking functions were introduced in [15] and [12] respectively. In this paper, let $G$ be a connected graph with vertex set $\{1,2,...,n\}$ and $m\in V(G)$. We give the definition of $(G,m)$-multiparking function. This definition unifies the conceptions of $G$-parking function and $G$-multiparking function. We construct bijections between the set of $(G,m)$-multiparking functions and the set of $\mathcal{F}_{G,m}$ of spanning color $m$-forests of $G$. Furthermore we define the $(G,m)$-multiparking complement function, give the reciprocity theorem for $(G,m)$-multiparking function and extend the results [25,12] to $(G,m)$-multiparking function. Finally, we use a combinatorial methods to give a recursion of the generating function of the sum $\sum\limits_{i=1}^na_i$ of $G$-parking functions $(a_1,...,a_n)$.

No associations


Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.


(G,m)-multiparking functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with (G,m)-multiparking functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and (G,m)-multiparking functions will most certainly appreciate the feedback.

Rate now


Profile ID: LFWR-SCP-O-556913

All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.