Note: Counting labelled trees with given indegree sequence

  • Authors:

  • Rosena R. X. Du;Jingbin Yin

  • Affiliations:

  • Department of Mathematics, East China Normal University, Shanghai 200241, PR China;Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA

  • Venue:
  • Journal of Combinatorial Theory Series A
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

For a labelled tree on the vertex set [n]:={1,2,...,n}, define the direction of each edge ij to be i-j if i