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
โฆ 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 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