Graph embedding aspect of IEH graphs

檔案

日期

2001-01-01

期刊名稱

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING

摘要

In order to overcome the drawback of the hypercube that the number of nodes is limited to a power of two, the incrementally extensible hypercube (IEH) graph is derived for an arbitrary number of nodes [12]. In this paper, we first prove that the incomplete hypercube (IH) is a spanning subgraph of IEH. Next. we present a new method to construct an IEH From an IH. From the aspect of graph embedding, we determine the minimum size of the IEH that contains a complete binary tree. WI: then embed a torus (with a side length as power of two) into an IEH with dilation 1 and expansion 1.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料