http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
The number of $(d,k)$-hypertrees
채갑병,Wai-Cheong Siu 호남수학회 2017 호남수학학술지 Vol.39 No.4
In this paper, we define and enumerate two tree-like hypergraph structures which we call them $(d,k)$-trees and $d$-trees, where $d \geq 2$ and $k > 0$ are integers. These new definitions generalize traditional and HP-hypertrees.
THE NUMBER OF (d, k)-HYPERTREES
Chae, Gab-Byung,Siu, Wai-Cheong The Honam Mathematical Society 2017 호남수학학술지 Vol.39 No.4
In this paper, we define and enumerate two tree-like hypergraph structures which we call them (d, k)-trees and d-trees, where $d{\geq}2$ and k > 0 are integers. These new definitions generalize traditional and HP-hypertrees.