A 2n matrix hypercube graph: A graph with edges of hypercube improved by a half

This study proposes a new interconnection network that has the same number of nodes in a hypercube graph broadly known as phase of a multicomputer but has edges reduced by a half. As a way of reducing the degree of nodes, node address can be assigned in a form of matrix and edges can be defined by means of matrix operations. Degree reduces H/W costs and diameter reduces S/W efficiency. Since an actual effect of S/W cost reduction is insufficient, a H/W cost reduction effect can be maximized by reducing edges by a half.