English

Tutte polynomial and G-parking functions

Combinatorics 2008-12-16 v1

Abstract

Let GG be a connected graph with vertex set {0,1,2,...,n}\{0,1,2,...,n\}. We allow GG to have multiple edges and loops. In this paper, we give a characterization of external activity by some parameters of GG-parking functions. In particular, we give the definition of the bridge vertex of a GG-parking function and obtain an expression of the Tutte polynomial TG(x,y)T_G(x,y) of GG in terms of GG-parking functions. We find the Tutte polynomial enumerates the GG-parking function by the number of the bridge vertices.

Keywords

Cite

@article{arxiv.0812.2817,
  title  = {Tutte polynomial and G-parking functions},
  author = {HungYung Chang and Jun Ma and Yeong-Nan Yeh},
  journal= {arXiv preprint arXiv:0812.2817},
  year   = {2008}
}
R2 v1 2026-06-21T11:52:11.877Z