抄録
Hypercube Qn is a well-known graph structure having three different kinds of equivalent definitions that are: 1. binary n bit sequences with the adjacency condition, 2. Q1=K2, $Q_n=Q_{n-1}\\Box K_2$, where $\\Box$ means the Cartesian product, 3. the Cayley graph on $\\mathbb{Z}_2^n$ with the generator set {10···0,010···0,···,0···01}. We give a necessary and sufficient condition for a set of binary sequences to be a generator set for the hypercube. Then, we give relations between some generator sets and relational products. These results show the wide variety of representability of hypercubes which would be used for many applications.
