𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Construction of Phase Cycles of Minimum Cycle Length: MakeCycle

✍ Scribed by J Ollerenshaw; R.E.D McClung

Book ID
102601256
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
128 KB
Volume
143
Category
Article
ISSN
1090-7807

No coin nor oath required. For personal study only.

✦ Synopsis

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, GHMBC, and INEPT pulse sequences. Copyright 2000 Academic Press.

πŸ“œ SIMILAR VOLUMES

Minimum cycle covers of graphs
Minimum cycle covers of graphs
✍ Fan, Genghua πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 145 KB πŸ‘ 1 views

Some new results on minimum cycle covers are proved. As a consequence, it is obtained that the edges of a bridgeless graph G can be covered by cycles of total length at most |E(G)| + 25 24 (|V (G)| -1), and at most |E(G)| + |V (G)| -1 if G contains no circuit of length 8 or 12.

The number of cycle lengths in graphs of
The number of cycle lengths in graphs of given minimum degree and girth
✍ P. ErdΕ‘s; R.J. Faudree; C.C. Rousseau; R.H. Schelp πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 333 KB

This paper determines lower bounds on the number of different cycle lengths in a graph of given minimum degree k and girth g. The most general result gives a lower bound of ck ~.

LENGTH OF THE MENSTRUAL CYCLE
LENGTH OF THE MENSTRUAL CYCLE
✍ Holli, Kaija; Hakama, Matti πŸ“‚ Article πŸ“… 1934 πŸ› The Lancet 🌐 English βš– 383 KB