Time-symmetric cycles.
Bernhardt, Chris (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Bernhardt, Chris (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
V. Chitra, A. Muthusamy (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m for all even ⋋ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m − F for all odd ⋋ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki and Brualdi and Schroeder) completely settle the existence of symmetric Hamilton cycle decomposition...
Schmid, Wilfried, Vilonen, Kari (2000)
Annals of Mathematics. Second Series
Similarity:
Emerson, Heath (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Bernhardt, Chris (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Devra Garfinkle (1992)
Compositio Mathematica
Similarity:
Edward G. Belaga (2003)
Acta Arithmetica
Similarity:
Walden, Byron L. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Władysław Narkiewicz (2002)
Journal de théorie des nombres de Bordeaux
Similarity:
It is shown that the methods established in [HKN3] can be effectively used to study polynomial cycles in certain rings. We shall consider the rings and shall describe polynomial cycles in the case when is either odd or twice a prime.
B. Kaufmann (1939)
Compositio Mathematica
Similarity:
Jordon, Heather (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: