The article addresses balanced clustering with a spanning tree over clusters. This problem
can be useful in network applications (design, control, and routing). Elements of different …

On Embedding of m-Sequential k-ary Trees into Hypercubes Page 1 Applied Mathematics,
2010, 3, 499-503 doi:10.4236/am.2010.16065 Published Online December 2010 (http://www.SciRP.org/journal/am) …

Interconnection networks, composed of numerous integrated circuits (ICs), form complex
structures crucial to many parallel computing systems. The effectiveness of very large scale …

A height-balanced tree is a rooted binary tree T in which for every vertex v∈ V (T), the
heights of the subtrees, rooted at the left and right child of v, differ by at most one; this …

A long standing conjecture of Havel (1984)[10] states that every equipartite tree with
maximum degree 3 on 2n vertices is a spanning subgraph of the n-dimensional hypercube …

A height-balanced tree is a rooted binary tree T in which for every vertex v∈ V (T), the
heights of the left and right subtrees of v, differ by at most one. In this paper, we embed two …

The cubical dimension of a graph G is the smallest dimension of a hypercube into which G is
embeddable as a subgraph. The conjecture of Havel (1984) claims that the cubical …

A graph embedding comprises of an ordered pair of injective maps ≺ f, p ≻≺ f, p≻ from a
guest graph G=(V (G), E (G)) G=(V (G), E (G)) to a host graph H=(V (H), E (H)) H=(V (H), E …

The article addresses balanced clustering problems with an additional requirement as a tree-
like structure over the obtained balanced clusters. This kind of clustering problems can be …

The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive
definition similar to the Fibonacci numbers. In this paper, we prove that a hypercube of …