Decompositions of complete graphs into triangles and Hamilton cycles

For all odd integers n greater than or equal to 1, let G(n) denote the complete graph of order n, and for all even integers n greater than or equal to 2 let G,, denote the complete graph of order n with the edges of a 1-factor removed. It is shown that for all non-negative integers h and t and all positive integers n, G, can be decomposed into h Hamilton cycles and t triangles if and only if nh + 3t is the number of edges in G(n). (C) 2004 Wiley Periodicals, Inc.

On Hamilton cycle decomposition of 6-regular circulant graphs

The circulant graph Sn, where S ⊆ Zn \ {0}, has vertex set Zn and edge set {{x, x + s}|x ∈ Zn, s ∈ S}. It is shown that there is a Hamilton cycle decomposition of every 6-regular circulant graph Sn in which S has an element of order n.

On a Five-Diagonal Jacobi Matrices and Orthogonal Polynomials on Rays in the Complex Plane

∗ Partially supported by Grant MM-428/94 of MESC.

Method of Finding Hamilton Routes in Transport Network

This article discusses a solution method for Hamilton Problem, which either finds the task's solution, or indicates that the task is unsolvable. Offered method has significantly smaller requirements for computing resources than known algorithms.

A Note on a Classical Generating Function for the Jacobi Polynomials

Mathematics Subject Classification: 33C45.

Fractional Extensions of Jacobi Polynomials and Gauss Hypergeometric Function

2000 Mathematics Subject Classification: 26A33, 33C45

Mean-Periodic Functions Associated with the Jacobi-Dunkl Operator on R

2000 Mathematics Subject Classification: 34K99, 44A15, 44A35, 42A75, 42A63

On some Jacobi Series

Георги С. Бойчев - Настоящата статия съдържа свойства на някои редове на Якоби.