Colored Prüfer codes for \(k\)-edge colored trees (Q1773178): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:39, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Colored Prüfer codes for \(k\)-edge colored trees |
scientific article |
Statements
Colored Prüfer codes for \(k\)-edge colored trees (English)
0 references
25 April 2005
0 references
Summary: A combinatorial bijection between \(k\)-edge colored trees and colored Prüfer codes for labelled trees is established. This bijection gives a simple combinatorial proof for the number \(k(n-2)!{nk-n\choose n-2}\) of \(k\)-edge colored trees with \(n\) vertices.
0 references
combinatorial bijection
0 references
labelled trees
0 references
