Tutte polynomial and G-parking functions
Combinatorics
2008-12-16 v1
Abstract
Let be a connected graph with vertex set . We allow to have multiple edges and loops. In this paper, we give a characterization of external activity by some parameters of -parking functions. In particular, we give the definition of the bridge vertex of a -parking function and obtain an expression of the Tutte polynomial of in terms of -parking functions. We find the Tutte polynomial enumerates the -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}
}