Some remarks on permutation modules
โ Scribed by Geoffrey R Robinson
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 995 KB
- Volume
- 118
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The permutation layout scheme proposed by Cutler-Shiloach [ l ] is not only of theoretical interest but also has much potentiality to be adopted in the practice of layout for hybrid IC's. The present note points out that there is a close relation between the permutation layout and the single-row ro
This paper deals with the determination of subsets of permutations, which satisfy certain conditions. Two new methods are proposed; one for the permutations that correspond to a given pattern, and one for the triple T = (A, M, CM) as it has been introduced by Viennot [S]. Both these two methods, can
## Abstract We prove a conjecture of Favaron et al. that every graph of order __n__ and minimum degree at least three has a total dominating set of size at least __n__/2. We also present several related results about: (1) extentions to graphs of minimum degree two, (2) examining graphs where the bo