Yeong‐Nan Yeh

activity

20062009

most citedEnumeration of subtrees of trees

72 citations · 75 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2009★ 2 cited

Generalizations of Chung-Feller Theorem II

Jun Ma, Yeong-nan Yeh

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$ -th Catalan number and independent on $m$ . L. Shapiro [9] found…

math.CO2008★ 1 cited

Generalizations of Chung-Feller Theorem

Jun Ma, Yeong-Nan Yeh

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with flaws $m$ is the $n$ -th Catalan number and independent on $m$ . L. Shapiro [7] found…

math.CO2008

Refinements of Lattice paths with flaws

Jun Ma, Yeong-Nan Yeh

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$ -th Catalan number and independent on $m$ . In this paper, we co…

math.CO2008

Tutte polynomial and G-parking functions

HungYung Chang, Jun Ma, Yeong-Nan Yeh

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 som…

math.CO2006★ 72 cited

Enumeration of subtrees of trees

Weigen Yan, Yeong-Nan Yeh

Let $T$ be a weighted tree. The weight of a subtree $T_{1}$ of $T$ is defined as the product of weights of vertices and edges of $T_{1}$ . We obtain a linear-time algorithm to count the…