Title: TOPOLOGICAL PROPERTIES OF SUPERCUBE
Authors: YUAN, SM
交大名義發表
資訊工程學系
National Chiao Tung University
Department of Computer Science
Keywords: FAULT-TOLERANT NETWORKS;PARALLEL PROCESSING;GRAPH THEORY;CONNECTIVITY;DIAMETER;NODE-DISJOINT PATH
Issue Date: 14-Mar-1991
Abstract: The N-node Supercube is a new generalized of Hypercube topology. Unlike the Binary Hypercube, the Supercube can be constructed for any number of nodes N. In addition, it maintains the connectivity and diameter properties of the corresponding hypercube. In this paper, we examine some topological properties of the Supercube from the graph-theory point of view.
URI: http://dx.doi.org/10.1016/0020-0190(91)90215-4
http://hdl.handle.net/11536/3838
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90215-4
Journal: INFORMATION PROCESSING LETTERS
Volume: 37
Issue: 5
Begin Page: 241
End Page: 245
Appears in Collections:Articles


Files in This Item:

  1. A1991FF07800001.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.