- Tytuł:
- Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having $k$ Edges
- Autorzy:
-
Jeevadoss, Shanmugasundaram
Muthusamy, Appu - Powiązania:
- https://bibliotekanauki.pl/articles/31234097.pdf
- Data publikacji:
- 2015-11-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
path
cycle
graph decomposition
multigraph - Opis:
- We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph $ K_{m,n} ( \lambda )$ into paths and cycles having $k$ edges. In particular, we show that such decomposition exists in $ K_{m,n} ( \lambda )$, when $ \lambda \equiv 0 (mod 2) $, $ m,n \geq k/2, m+n > k $ and $ k(p + q) = 2mn $ for $ k \equiv 0 (mod 2) $ and also when $ \lambda \geq 3 $, $ \lambda m \equiv \lambda n \equiv 0(mod 2) $, $ k(p + q) =\lambda m n $, $m, n \geq k $, (resp., $ m, n \geq 3k//2$) for $ k \equiv 0(mod 4)$ (respectively, for $ k \equiv 2(mod 4)$). In fact, the necessary conditions given above are also sufficient when $ \lambda = 2 $.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2015, 35, 4; 715-731
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł