Colored Prufer codes for k-edge colored trees

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 2548
  • Download : 639
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/n-2) of k-edge colored trees with n vertices.
Publisher
ELECTRONIC JOURNAL OF COMBINATORICS
Issue Date
2004-07
Language
English
Article Type
Article
Citation

ELECTRONIC JOURNAL OF COMBINATORICS, v.11, no.1, pp.301 - 308

ISSN
1077-8926
URI
http://hdl.handle.net/10203/5052
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
000222776000002.pdf(84.19 kB)Download
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0