๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Generalized orthogonal arrays: Constructions and related graphs

โœ Scribed by Michael J. Adams


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
172 KB
Volume
7
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Fast generation of regular graphs and co
โœ Meringer, Markus ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 162 KB ๐Ÿ‘ 2 views

The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics. In this article an efficient algorithm to generate regular graphs with a given number of vertices and vertex degree is introduced. The method is based on orderly genera

The hope construct, will, and ways: Thei
โœ Philip R. Magaletta; J. M. Oliver ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB

This investigation (N = 204) examined (a) the relations between the hope construct (Snyder, Harris et al., 1991; Snyder, Irving, & Anderson, 1991) and its two essential components, "will" and "ways," and the related constructs of self-efficacy and optimism; and (b) the ability of hope, self-efficacy