Topological properties of incomplete WK-recursive networks
β Scribed by Su, Ming-Yang; Chen, Gen-Huey; Duh, Dyi-Rong
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 599 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
β¦ Synopsis
Recently, WK-recursive networks have received much attention due to their many favorable properties. However, they suffered from a rigorous restriction on their sizes. Incomplete WK-recursive networks were proposed to relieve this restriction. In this paper, the topological properties of incomplete WK-recursive networks are investigated. It is shown that they contain Hamiltonian cycles if their connectivities are greater than one. A sufficient and necessary condition is also proposed for those with connectivity one to contain a Hamiltonian path. A linear-time algorithm using the prune-and-search technique is presented to compute their diameters.
π SIMILAR VOLUMES
In this paper, we consider a highly recursive interconnection network known as the fully connected cubic network (FCCN). By exploiting its recursive properties, we thoroughly analyze the performance of a simple routing algorithm for the FCCN. We show that at least 800 of the routes obtained from thi
## Abstract **Summary:** We propose a new approach for predicting polymer properties from structured molecular representations based on recursive neural networks. To this aim, a structured representation is designed for the modeling of polymer structures. This representation can also account for av
The self-assembly of polymeric open networks from di4erent Ag(I) salts and the potentially tetradentate ligand hexamethylenetetramine (hmt) has revealed a variety of possible structural motifs, depending on the reagent ratios and the counterions, that are discussed in comparison. Three new Ag(I) coo