Hamilton cycle decomposition of the Butter y networks
نویسندگان
چکیده
In this paper we prove that the wrapped Butterry graph WBF(d;n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud who solved the case d = 2.
منابع مشابه
Symmetric Hamilton Cycle Decompositions of Complete Graphs Minus a 1-Factor
Let n ≥ 2 be an integer. The complete graph Kn with a 1-factor F removed has a decomposition into Hamilton cycles if and only if n is even. We show that Kn − F has a decomposition into Hamilton cycles which are symmetric with respect to the 1-factor F if and only if n ≡ 2, 4 mod 8. We also show that the complete bipartite graph Kn,n has a symmetric Hamilton cycle decomposition if and only if n ...
متن کاملSolving linear and nonlinear optimal control problem using modified adomian decomposition method
First Riccati equation with matrix variable coefficients, arising in optimal and robust control approach, is considered. An analytical approximation of the solution of nonlinear differential Riccati equation is investigated using the Adomian decomposition method. An application in optimal control is presented. The solution in different order of approximations and different methods of approximat...
متن کاملOn the Bisection Width and Expansion of Butter y Networks
This paper proves tight bounds on the bisection width and expansion of butter y networks with and without wraparound. We show that the bisection width of an n-input butter y network is 2(p2 1)n+ o(n) :82n without wraparound, and n with wraparound. The former result is surprising, since it contradicts the prior \folklore" belief that the bisection width was n. We also show that every set of k no...
متن کاملEmbedding Complete Binary Trees into Butter y Networks
In this paper we present embeddings of complete binary trees into butter y networks with or without wrap-around connections. Let m be an even integer and q = m+ blogmc 1. We show how to embed a 2q+1 1-node complete binary tree T (q) into a (m + 1)2m+1node wrap-around butter y Bw(m+1) with a dilation of 4; and how to embed T (q) into a (m+2)2m+2-node wrap-around butter y Bw(m+2) with an optimal ...
متن کاملHamilton Cycle Decomposition of the Butterfly Network
in this paper, we prove that the wrapped Butterfly graph WBF(d; n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud who solved the case d = 2. Key-words: Butterfly graph, graph theory, Hamiltonism, Hamilton decomposition, Hamilton cycle, Hamilton circuit, perfect matching. (Résumé : tsvp) This work has been supported by the C...
متن کامل