Minimum-length fundamental cycle set
β Scribed by Deo, N.
- Book ID
- 117914068
- Publisher
- IEEE
- Year
- 1979
- Weight
- 244 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0098-4094
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An algorithm for the generation of a phase cycle of minimum length for a pulse sequence is developed from the basic requirement that only specified coherence transfer pathways will be accumulated. The efficacy of the algorithm is shown by determining the phase cycles of minimum length for DQFCOSY, G
## Abstract Our main result is the following theorem. Let __k__ββ₯β2 be an integer, __G__ be a graph of sufficiently large order __n__, and __Ξ΄__(__G__)ββ₯β__n__/__k__. Then: __G__ contains a cycle of length __t__ for every even integer __t__βββ[4, __Ξ΄__(__G__)β+β1]. If __G__ is nonbipartite then