论文信息 - Prüfer codes for acyclic hypertrees - 字舞流文

Prüfer codes for acyclic hypertrees

We describe a new Prufer code based on star-reductions which works for infinite acyclic hypertrees.

[1] Béla Bollobás,et al. Graph Theory: An Introductory Course , 1980, The Mathematical Gazette.

[2] Frank Harary,et al. Graph Theory , 2016 .

[3] Charalambos A. Charalambides,et al. Enumerative combinatorics , 2018, SIGA.

[4] A. Cayley. A theorem on trees , 2009 .

[5] R. Stanley. Enumerative Combinatorics: Volume 1 , 2011 .