The number of parking functions with center of a given length
Let 1≤r≤n and suppose that, when the Depth-first Search Algorithm is applied to a given rooted labeled tree on n+1 vertices, exactly r vertices are visited before backtracking. Let R be the set of trees with this property. We count the number of elements of R. For this purpose, we first consider a b...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2020
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/25846 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/25846 |