III. Plants and Color a. Can plants see color? b. Can plants sense color? c. What do plants do with light energy absorbed by pigments? d. Why is photosynthesis important to plants? e. What is thisâ€¦ (More)

An antimagic labeling of a graph with m edges and n vertices is a bijection from the set of edges to the integers 1, . . . ,m such that all n vertex sums are pairwise distinct, where a vertex sum isâ€¦ (More)

We deal with Oberwolfach factorizations of the complete graphs Kn and K n *, which admit a regular group of automorphisms. We show that the existence of such a factorization is equivalent to theâ€¦ (More)

A partial cDNA clone for the Duchenne's muscular dystrophy (DMD) locus was used to investigate the expression of this locus in human muscle in vitro. Hybridization to a 14-kilobase RNA transcript wasâ€¦ (More)

Let nÂ¿ 3 be an integer, and let k denote either n or n âˆ’ 1. A large set of disjoint decompositions of Kâˆ— n (Kn) into cycles of length k (denoted by k-LSD), is a partition of the set of all cycles ofâ€¦ (More)

For each parallel class Pi , 1 â‰¤ i â‰¤ n there corresponds a permutation Ïƒi acting on the letter set {1, 2, . . . , n} as follows: Ïƒi (k) = l iff (k, l ) is an arc ofPi . Let G be the group generatedâ€¦ (More)

We give upper bounds on the order of the automorphism group of a simple graph In this note we present some upper bounds on the order of the automorphism group of a graph, which is assumed to beâ€¦ (More)