Results 251 to 260 of about 4,376,990 (279)
Some of the next articles are maybe not open access.
Hamiltonian decompositions of strong products
Journal of Graph Theory, 1998Summary: It is shown that if two graphs are Hamiltonian decomposable, then so is their strong product.
Fan, Cong, Liu, Jiuqiang
openaire +2 more sources
Strong Interactions and Associated Production
Physical Review Letters, 1958The concept of a hierarchy of strong interactions allows a number of possibilities for the particular inter-action Lagrangian. The production processes for LAMBDA K deg , EPSILON deg K deg , EPSILON -K/sup +/, and EPSILON +K/sup +/ from pi + N collisions were investigated in an attempt to reduce the possible choices. (W.D.M.)
openaire +1 more source
Product Operations in Strong Monads
1993If a strong monad M is used to define the denotational semantics of a functional language with computations, a product operation x : MX × MY → M ( X × Y) is needed to define the semantics of pairing. Every strong monad is equipped with two standard products, which correspond to left-to-right and right-to-left evaluation.
openaire +1 more source
Minimum strong radius of the strong product of paths
Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022), 2023Shuyang Liu, Feng Li
openaire +1 more source
SUPEREULERIAN OF STRONG PRODUCTS
Far East Journal of Mathematical Sciences (FJMS), 2020openaire +1 more source