Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

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

100%

Jeevadoss S., Muthusamy A.

Discussiones Mathematicae Graph Theory

2015

tom 35

nr 4

715-731

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 λ = 2.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Jeevadoss S.

1 Muthusamy A.

1 2015

Wyniki wyszukiwania

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