✦ LIBER ✦

Enumeration of networks

✍ Scribed by P. F. Thomson

Publisher: John Wiley and Sons
Year: 1976
Tongue: English
Weight: 322 KB
Volume: 10
Category: Article
ISSN: 0029-5981
DOI: 10.1002/nme.1620100118

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On enumerating the trees of a ladder net

On enumerating the trees of a ladder network

✍ D. E. Johnson; J. R. Johnson 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB

ENUMERATION OF SOME CLASSES OF RECURSIVE

ENUMERATION OF SOME CLASSES OF RECURSIVELY ENUMERABLE SETS

✍ Kempachiro Ohashi 📂 Article 📅 1964 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB

Enumeration of Hypergraphs

✍ Toru Ishihara 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 87 KB

In this paper, we will study enumeration of hypergraphs. Let S p be a symmetric group acting on a p-setX . It induces the permutation group S \* p acting on the set of all subsets of X . Our problem is reduced to finding a good formula for the cycle index of S \* p . A crucial point is to calculate

Enumeration of Planar Constellations

✍ Mireille Bousquet-Mélou; Gilles Schaeffer 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 270 KB

The enumeration of transitive ordered factorizations of a given permutation is a combinatorial problem related to singularity theory. Let n ≥ 1, and let σ 0 be a permutation of n having d i cycles of length i, for i ≥ 1. Let m ≥ 2. We prove that the number of m-tuples σ 1 σ m of permutations of n su

Enumeration of Metacyclicp-Groups

✍ Steven Liedahl 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Correction to “Strong Reducibilities of

Correction to “Strong Reducibilities of Enumerations and Partial Enumerated Algebras”

✍ Andrzej Orlicki 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 62 KB