상세 보기
REFINED ENUMERATION OF VERTICES AMONG ALL ROOTED ORDERED d-TREES
- Kim, Sangwook;
- Seo, Seunghyun;
- Shin, Heesung
Citations
WEB OF SCIENCE
1Citations
SCOPUS
1초록
In this paper, we enumerate the cardinalities for the set of all vertices of outdegree >= k at level >= L among all rooted ordered d-trees with n edges. Our results unite and generalize several previous works in the literature.
키워드
rooted ordered d-tree; lattice path; bijection; degree; level
- 제목
- REFINED ENUMERATION OF VERTICES AMONG ALL ROOTED ORDERED d-TREES
- 저자
- Kim, Sangwook; Seo, Seunghyun; Shin, Heesung
- 발행일
- 2019-07
- 유형
- Article
- 저널명
- 대한수학회보
- 권
- 56
- 호
- 4
- 페이지
- 899 ~ 910
- 언어
- ENG
- 출판사
- KOREAN MATHEMATICAL SOC
- 발행국가
- 대한민국
- 분량
- 12 페이지
- ISSN
- E 2234-3016
P 1015-8634