✦ LIBER ✦

Canonical indexing and constructive enumeration of molecular graphs

✍ Scribed by Kvasnicka, Vladimir; Pospichal, Jiri

Book ID: 126136598
Publisher: American Chemical Society
Year: 1990
Tongue: English
Weight: 863 KB
Volume: 30
Category: Article
ISSN: 0095-2338
DOI: 10.1021/ci00066a001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved method of constructive enume

An improved method of constructive enumeration of graphs

✍ V. Kvasnička; J. Pospíchal 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 953 KB

Enumeration of pathsets of reliability g

Enumeration of pathsets of reliability graphs by repeated indexing

✍ M.A. Aziz; M.A. Sobhan; M.A. Samad 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 451 KB

On the construction and enumeration of H

On the construction and enumeration of Hamiltonian graphs

✍ Hu Guanzhang; Li Minshan 📂 Article 📅 1993 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 216 KB

Enumeration of Cayley graphs and digraph

Enumeration of Cayley graphs and digraphs

✍ Brian Alspach; Marni Mishna 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 137 KB

On the constructive enumeration of packi

On the constructive enumeration of packings and coverings of index one

✍ A.J. Petrenjuk 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 899 KB

Asymptotic enumeration of full graphs

✍ D. J. Kleitman; F. R. Lasaga; L. J. Cowen 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 539 KB

## Abstract A __full graph__ on __n__ vertices, as defined by Fulkerson, is a representation of the intersection and containment relations among a system of __n__ sets. It has an undirected edge between vertices representing intersecting sets, and a directed edge from __a__ to __b__ if the correspo