Displaying similar documents to “Skolem-type difference sets for cycle systems.”

Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having k Edges

Shanmugasundaram Jeevadoss, Appu Muthusamy (2015)

Discussiones Mathematicae Graph Theory

Similarity:

We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph Km,n(λ) into paths and cycles having k edges. In particular, we show that such decomposition exists in Km,n(λ), when λ ≡ 0 (mod 2), [...] and k(p + q) = 2mn for k ≡ 0 (mod 2) and also when λ ≥ 3, λm ≡ λn ≡ 0(mod 2), k(p + q) =λ_mn, m, n ≥ k, (resp., m, n ≥ 3k/2) for k ≡ 0(mod 4) (respectively, for k ≡ 2(mod 4)). In fact, the necessary conditions given above are also sufficient when λ =...

On the Decompositions of Complete Graphs into Cycles and Stars on the Same Number of Edges

Atif A. Abueida, Chester Lian (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Let Cm and Sm denote a cycle and a star on m edges, respectively. We investigate the decomposition of the complete graphs, Kn, into cycles and stars on the same number of edges. We give an algorithm that determines values of n, for a given value of m, where Kn is {Cm, Sm}-decomposable. We show that the obvious necessary condition is sufficient for such decompositions to exist for different values of m.