Detailed Information
Cited 0 time in 
Cited 1 time in 
Cited 1 time in
Metadata Downloads
Pick two points in a tree
- Authors
- Kim, H.; Shapiro, L.W.
- Issue Date
- Sep-2019
- Publisher
- Korean Mathematical Society
- Keywords
- Dependent vertices; Independent vertices; Probability; Riordan matrices; �ordered trees
- Citation
- Journal of the Korean Mathematical Society, v.56, no.5, pp 1247 - 1263
- Pages
- 17
- Indexed
- SCIE
SCOPUS
KCI
- Journal Title
- Journal of the Korean Mathematical Society
- Volume
- 56
- Number
- 5
- Start Page
- 1247
- End Page
- 1263
- ISSN
- 0304-9914
2234-3008
- Abstract
- In ordered trees, two randomly chosen vertices are said to be dependent if one lies under the other. If not, we say that they are independent. We consider several classes of ordered trees with uniform updegree requirements and find the generating functions for the trees with two marked dependent/independent vertices. As a result, we compute the probability for two vertices being dependent/independent. We also count such trees by the distance between two independent vertices. © 2019 Korean Mathematical Society.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Institute of Basic Science > Institute of Basic Science > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.