Independent spanning cycle-rooted trees in the cartesian product of digraphs
โ Scribed by Toru Hasunuma
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 250 KB
- Volume
- 7
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract We show that the Cartesian product of two directed cycles __Z__~__a__~ X __Z__~__b__~ has __r__ disjointly embedded circuits __C__~1~, __C__~2~, โ, __C__~r~ with specified knot classes knot__(C~i~) = (m~i~, n~i~)__, for __i__ = 1, 2, โ, __r__, if and only if there exist relatively prime
We find necessary and sufficient conditions for the existence of a closed walk that traverses r vertices twice and the rest once in the Cayley digraph of 2, @ 2,. This is a generalization of the results known for r = 0 or 1. In 1978, Trotter and Erdos [3] gave a necessary and sufficient condition f
Development of computer support in design is showing several shifts in focus over the latest decades. This paper relates to the shifts from detail design to conceptualization, from artifact geometry definition only to the inclusion of process knowledge, and from isolated aspects to integrated aspect