✦ LIBER ✦

The enumeration of trees with and without given limbs

✍ Scribed by Taojun Lu

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 720 KB
Volume: 154
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00041-t

No coin nor oath required. For personal study only.

✦ Synopsis

A limb of a tree is the union of one or more branches at a vertex in the tree, where a branch of a tree at a vertex is a maximal subtree containing the given vertex as an end-vertex. In this note, we first consider the enumeration of trees (undirected, oriented or mixed) with forbidden limbs. The enumeration result for trees with a single forbidden limb proves directly that the number of trees (undirected, oriented or mixed) with a forbidden limb is independent of the structure of the limb (in the undirected case, Schwenk has given a bijective proof). We further extend the method to enumerate trees with a number of forbidden limbs. Finally we enumerate trees with respect to the number of vertices and the number of edge-disjoint limbs that are isomorphic to a given limb. Many examples are given for illustration.

📜 SIMILAR VOLUMES

Bioavailability of fluvoxamine given wit

Bioavailability of fluvoxamine given with and without food

✍ J. Van Harten; P. Van Bemmel; M. R. Dobrinska; R. K. Ferguson; M. Raghoebar 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 298 KB

## Abstract The influence of concomitant food intake on plasma concentrations of the antidepressant drug fluvoxamine maleate was investigated in a two‐way, crossover study design. Eight male and four female healthy, young volunteers received a single oral dose of fluvoxamine maleate (50 mg, tablet)

The enumeration of integer sequences wit

The enumeration of integer sequences with a given number of colored records

✍ Heinrich Niederhausen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 685 KB

Permanent of the laplacian matrix of tre

Permanent of the laplacian matrix of trees with a given matching

✍ John L Goldwasser 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 715 KB

We define the Laplacian ratio of a tree z(T), to be the permanent of the Laplacian matrix of T divided by the product of the degrees of the vertices. Best possible lower and upper bounds are obtained for ~r(T) in terms of the size of the largest matching in T.

On Enumerating the Trees of the Wheel an

On Enumerating the Trees of the Wheel and Other Special Graphs

✍ David E. Johnson; Johnny R. Johnson 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 479 KB

A specialized method is presented for listing all the spanning trees of the wheel, homeomorphs of the wheel, and certain cellular arrays. The procedure is a generalization of a known method of enumerating the trees of a suitably labeled ladder graph, and results in a direct listing of the trees with

The distribution of nodes of given degre

The distribution of nodes of given degree in random trees

✍ Drmota, Michael; Gittenberger, Bernhard 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 391 KB 👁 2 views

Let T n denote the set of unrooted unlabeled trees of size n and let k ≥ 1 be given. By assuming that every tree of T n is equally likely, it is shown that the limiting distribution of the number of nodes of degree k is normal with mean value ∼ µ k n and variance ∼ σ 2 k n with positive constants µ

Asymptotic enumeration of tournaments wi

Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph

✍ Zhicheng Gao; Brendan D. McKay; Xiaoji Wang 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

This paper studies the probability that a random tournament with specified score sequence contains a specified subgraph. The exact asymptotic value is found in the case that the scores are not too far from regular and the subgraph is not too large. An ndimensional saddle-point method is used. As a s