On connected sub-tree of Cayley tree of order 2 with fixed nodes

We found an exact formulation for a finite sub-tree counting problem. Solution to two extremal cases are Catalan Triangle introduced by Shapiro and ballot Catalan triangles. The general solution could be expressed as linear combination of these Catalan triangles.

保存先:
書誌詳細
主要な著者: Mukhamedov, Farrukh, Pah, Chin Hee, Saburov, Mansoor
フォーマット: Conference or Workshop Item
言語:English
出版事項: American Institute of Physics 2013
主題:
オンライン・アクセス:http://irep.iium.edu.my/32234/1/Catalan_Numbers-AIP.pdf
http://irep.iium.edu.my/32234/
http://proceedings.aip.org/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!