Colored prufer codes and t-cores프뤼퍼 채색 부호와 t-코어

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 581
  • Download : 0
In section 1, a combinatorial bijection between k-edge colored trees and colored Prufer codes for labelled trees is established. This bijection gives a simple combinatorial proof for the number $k(n-2)!{nk-n \choose n-2}$ of k-edge colored trees with n vertices. We consider slightly different edge-coloring of labelled trees using colored Prufer codes. We also consider slightly different edge-coloring and slightly different vertex-coloring simultaneously of labelled trees using colored Prufer codes. In section 2, combinatorial proofs using Ferrers diagram are established in some cases of monotonicity conjecture of Stanton.
Advisors
Kim, Dong-Suresearcher김동수researcher
Description
한국과학기술원 : 수학전공,
Publisher
한국과학기술원
Issue Date
2006
Identifier
254190/325007  / 000995352
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 수학전공, 2006.2, [ 41 p. ]

Keywords

t-cores; 프뤼퍼 채색 부호; t-코어; Colored Prufer codes

URI
http://hdl.handle.net/10203/41888
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=254190&flag=dissertation
Appears in Collection
MA-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0