pith. sign in

arxiv: 0812.2817 · v1 · submitted 2008-12-15 · 🧮 math.CO

Tutte polynomial and G-parking functions

classification 🧮 math.CO
keywords parkingfunctionspolynomialtuttebridgefunctiongivevertex
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.