Colored Prüfer codes for \(k\)-edge colored trees (Q1773178)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Colored Prüfer codes for k-edge colored trees |
scientific article; zbMATH DE number 2161291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colored Prüfer codes for \(k\)-edge colored trees |
scientific article; zbMATH DE number 2161291 |
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
0.7579231858253479
0 references
0.756353497505188
0 references
0.7544251084327698
0 references
