𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enumeration of self-complementary structures

✍ Scribed by Detlef Wille

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
333 KB
Volume
25
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Equivalence between Enumerating Cycl
The Equivalence between Enumerating Cyclically Symmetric, Self-Complementary and Totally Symmetric, Self-Complementary Plane Partitions
✍ Mihai Ciucu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 142 KB

We prove that the number of cyclically symmetric, self-complementary plane partitions contained in a cube of side 2n equals the square of the number of totally symmetric, self-complementary plane partitions contained in the same cube, without explicitly evaluating either of these numbers. This appea

Nanofibers Self-assembled from Structura
Nanofibers Self-assembled from Structural Complementary Borono-decapeptides
✍ Chang-Sheng Chen; Tian-Jiao Ji; Xiao-Ding Xu; Xian-Zheng Zhang; Ren-Xi Zhuo 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 396 KB

## Abstract A series of structural complementary decapeptides with phenyl boronic acid tails or borono‐decapeptides (BPs) were designed and synthesized for supramolecular self‐assembly. After dissolving these borono‐decapeptides in deionized (DI) water, well‐defined nanofibers were formed in BP1 (B

Enumeration of kekulé structures in poly
Enumeration of kekulé structures in polymers
✍ A. Graovc; D. Babić; M. Strunje 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 310 KB

A procedure 1s described which allows the evaluation of the number of Kekule structures, K, for any polymer. In the case of regular polymers explicit recurrence relations for K are derived where the order of the recurrence depends on the number of edges linking two consecutive monomers.

Characterization of self-complementary s
Characterization of self-complementary symmetric digraphs
✍ Hong Zhang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 266 KB

The class of self-complementary symmetric digraphs is characterized and it is shown that the number of vertices of such a digraph is an odd prime power.