𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computer enumeration and generation of physical trees

✍ Scribed by J. V. Knop; W. R. Müller; K. Szymanski; H. W. Kroto; N. Trinajstić

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
336 KB
Volume
8
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis

A computer-oriented method for the enumeration and generation of physical trees is presented. Physical trees depict acyclic chemical structures, but the term physical is used to stress the process by which the structures are produced.

📜 SIMILAR VOLUMES

Enumeration and generation of a class of
Enumeration and generation of a class of regular digraphs
✍ M. V. S. Ramanath; T. R. Walsh 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

We study the class of directed graphs that have indegree = outdegree = 2 a t every vertex. These digraphs can be decomposed uniquely into "alternating cycles"; w e use this decomposition to present efficient techniques for counting and generating them. The number (up to isomorphism) of these digraph

Computer generation of coupled-cluster e
Computer generation of coupled-cluster equations
✍ Frank E. Harris 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB 👁 1 views

A Maple V computer program for obtaining conventional algebraic representations of coupled-cluster equations is described and its use illustrated. The program is available on the World Wide Web.

Enumeration of generalized Hadamard matr
Enumeration of generalized Hadamard matrices of order 16 and related designs
✍ P. B. Gibbons; R. Mathon 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

## Abstract We investigate signings of symmetric GDD($16 \times 2^i$, 16, $2^{4-i}$)s over $Z\_2$ for $1 \le i \le 3$. Beginning with $i=1$, at each stage of this process a signing of a GDD($16 \times 2^i$, 16, $2^{4-i}$) produces a GDD($16 \times 2^{i+1}$, 16, $2^{4-i-1}$). The initial GDDs ($i=1$