Home > Papers

 
 
$G$-parking functions and minimal deletion-contraction sequences of graphs
Ma Jun 1,Yeh Yeong-Nan 2 *
1.Department of Mathematics, Shanghai Jiaotong University, Shanghai 200240
2.Institute of Mathematics, Academia Sinica, Taipei 10617
*Correspondence author
#Submitted by
Subject:
Funding: Specialized Research Fund for the Doctoral Program of Higher Education （No.20110073120068）
Opened online:26 November 2015
Accepted by: none
Citation: Ma Jun,Yeh Yeong-Nan.$G$-parking functions and minimal deletion-contraction sequences of graphs[OL]. [26 November 2015] http://en.paper.edu.cn/en_releasepaper/content/4663695
 
 
In this paper, for a connected graph $G$, we establish a bijectionfrom the set of minimal deletion-contraction sequences of $G$ tothe set of $G$-parking functions. With the benefit of thebijection, we express the universal polynomial of $G$ in terms of weights of$G$-parking functions.
Keywords:combinatorial mathematics; parking function; spanning tree; Tutte polynomial
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 36
Bookmarked 0
Recommend 0
Comments Array
Submit your papers