๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Directed Hamilton Cycle Decompositions of the Tensor Products of Symmetric Digraphs

โœ Scribed by P. Paulraja; S. Sivasankar


Book ID
106047805
Publisher
Springer Japan
Year
2009
Tongue
English
Weight
166 KB
Volume
25
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Symmetric Hamilton cycle decompositions
โœ Jin Akiyama; Midori Kobayashi; Gisaku Nakamura ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 95 KB ๐Ÿ‘ 1 views

## Abstract We construct a new symmetric Hamilton cycle decomposition of the complete graph __K~n~__ for odd __n__โ€‰>โ€‰7. ยฉ 2003 Wiley Periodicals, Inc.

Hamilton cycles in tensor product of gra
โœ R. Balakrishnan; P. Paulraja ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 598 KB

In this paper, we characterize graphs G for which GยฎK2 is Hamiltonian, where ยฎ denotes the tensor product of graphs. The relationship between the bieulerian orientation of a 4-regular graph G and the existence of a pair of edge-disjoint Hamilton cycles in GยฎK2 is established. Also a characterization

Symmetric Hamilton cycle decompositions
โœ Richard A. Brualdi; Michael W. Schroeder ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 190 KB ๐Ÿ‘ 1 views

Let n โ‰ฅ 2 be an integer. The complete graph K n with a 1-factor F removed has a decomposition into Hamilton cycles if and only if n is even. We show that K n -F has a decomposition into Hamilton cycles which are symmetric with respect to the 1-factor F if and only if n โ‰ก 2,4 mod 8. We also show that