We also show that the complete binarytree of height h > 1 contains precisely ⌊2(1.24602...)^2^h⌋nonisomorphic leaf-induced subtrees.

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A110317637
AUDACE A. V. DOSSOU-OLORY (Centre d’excellence d’afrique pour l’eau et l’assainissement, University of Abomey-Calavi, Benin.) ; IGNATIUS BOADI (african institute for mathematical sciences, ghana, summerhill estates, east legon hills, santoe accra, ghana.)
2026
English
KCI등재,SCOPUS
학술저널
367-392(26쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
We also show that the complete binarytree of height h > 1 contains precisely ⌊2(1.24602...)^2^h⌋nonisomorphic leaf-induced subtrees.
We also show that the complete binarytree of height h > 1 contains precisely ⌊2(1.24602...)^2^h⌋nonisomorphic leaf-induced subtrees.
1. Mappings between Schrödinger equations
15. Boundary chromatic number in graphs
4. Equal-cubic graph of finite groups