Counting Labelled Trees with Given Indegree Sequence

Details Counting Labelled Trees with Given Indegree Sequence Counting Labelled Trees with Given Indegree Sequence

2007-12-24

arxiv.org/abs/0712.4032v2

Mathematics

Combinatorics

10 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Counting Labelled Trees with Given Indegree Sequence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting Labelled Trees with Given Indegree Sequence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Labelled Trees with Given Indegree Sequence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-184768