The primitivity of the strong product of two directed graphs
✍ Scribed by Maria Kwaśnik
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 308 KB
- Volume
- 121
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We introduce the concept of the primitivity of independent set in vertex-transitive graphs, and investigate the relationship between the primitivity and the structure of maximum independent sets in direct products of vertex-transitive graphs. As a consequence of our main results, we positively solve
We say a digraph G is hyperhamiltonian if there is a spanning closed walk in G which passes through one vertex exactly twice and all others exactly once. We show the Cartesian product Z, x Z, of two directed cycles is hyperhamiltonian if and only if there are positive integers rn and n with ma + nb
## 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