✦ LIBER ✦

On a class of linked diagrams, I. Enumeration

✍ Scribed by Paul R Stein

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 479 KB
Volume: 24
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(78)90065-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The enumeration of connected graphs and

The enumeration of connected graphs and linked diagrams

✍ Albert Nijenhuis; Herbert S Wilf 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 201 KB

On a Class of Recursively Enumerable Set

On a Class of Recursively Enumerable Sets

✍ Farzad Didehvar 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 1 views

## Abstract We define a class of so‐called ∑(__n__)‐sets as a natural closure of recursively enumerable sets __W__~n~ under the relation “∈” and study its properties.

On a Class of Enumeration Problems in Ad

On a Class of Enumeration Problems in Additive Arithmetics

✍ D. Ugrinsparac 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 302 KB

Enumeration of a symmetry class of plane

Enumeration of a symmetry class of plane partitions

✍ W.H Mills; David P Robbins; Howard Rumsey Jr 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 692 KB

Enumerating a class of nested group test

Enumerating a class of nested group testing procedures

✍ J.W Moon; M Sobel 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 222 KB

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