✦ LIBER ✦

Counting Special Families of Labelled Trees

✍ Scribed by Chunwei Song

Publisher: Springer
Year: 2006
Tongue: English
Weight: 154 KB
Volume: 10
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-006-0287-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting labels in binary trees

✍ Renzo Sprugnoli 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 362 KB

A combinatorial family of labeled trees

✍ Paul Klingsberg 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Tree counting polynomials for labelled g

Tree counting polynomials for labelled graphs part I: Properties

✍ Samuel D. Bedrosian 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 753 KB

The properties of special pairs of tree counting polynomials that relate to a class of incomplete graphs and their complements are presented. These polynomial pairs are related by the previously defined binary complementing operation. In contrast with alternative graph representations, they offer th

A new proof of Cayley's formula for coun

A new proof of Cayley's formula for counting labeled trees

✍ Peter W Shor 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Point Counting in Families of Hyperellip

Point Counting in Families of Hyperelliptic Curves

✍ Hendrik Hubrechts 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 665 KB

Convex labelings of trees

✍ Stephen J. Dow; Douglas F. Rall; Peter J. Slater 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 456 KB

A convex labeling of a tree T o f order n is a one-to-one function f from the vertex set of Tinto the nonnegative integers, so that f ( y ) 5 ( f ( x ) t f(z))/2 for every path x, y, z of length 2 in T. If, in addition, f (v) I n -1 for every vertex v of T, then f is a perfect convex labeling and T