𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs

✍ Scribed by Zhang Fuji; Guo Xiaofeng

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
521 KB
Volume
32
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The set of generalized exponents of prim
The set of generalized exponents of primitive simple graphs
✍ Jia-Yu Shao; Bin Li 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 979 KB

The exponent of a primitive digraph is the smallest integer k such that for each ordered pair of (not necessarily distinct) vertices x and y there is a walk of length k from x to y. The exponent set (the set of those numbers attainable as exponents of primitive digraphs with n vertices) and bounds o

Generation of Kekulé valence structures
Generation of Kekulé valence structures and the corresponding valence bond wave function
✍ Zahid Rashid; Joop H. van Lenthe 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 797 KB

## Abstract A new scheme, called “list of nonredundant bonds”, is presented to record the number of bonds and their positions for the atoms involved in Kekulé valence structures of (poly)cyclic conjugated systems. Based on this scheme, a recursive algorithm for generating Kekulé valence structures

The incremental maintenance of a Depth-F
The incremental maintenance of a Depth-First-Search tree in directed acyclic graphs
✍ Paolo G. Franciosa; Giorgio Gambosi; Umberto Nanni 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 748 KB

We propose an incremental algorithm to maintain a DFS-forest in a directed acyclic graph under a sequence of arc insertions in 0( nm) worst case total time, where n is the number of nodes and m is the number of arcs after the insertions. This compares favorably with the time required to recompute DF