Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On the number of ver ...
Article

On the number of vertices of each rank in phylogenetic trees and their generalizations

Miklós Bóna
Download article
Open on arXiv
Imported on
April 11, 2016
Published on
April 11, 2016
Last modified on
March 31, 2025
Volume 18
vol. 18:3
Combinatorics
DOI
10.46298/dmtcs.653
License
arXiv.org - Non-exclusive license to distribute
Indicators
1249
Views
923
Downloads

On the number of vertices of each rank in phylogenetic trees and their generalizations

Miklós Bóna
Abstract
We find surprisingly simple formulas for the limiting probability that the rank of a randomly selected vertex in a randomly selected phylogenetic tree or generalized phylogenetic tree is a given integer. Comment: 7 pages, 1 figure
Keywords
  • Mathematics - Combinatorics
  • 05A15, 05A16
Preview
Loading PDF preview...