In graph theory, the halved cube graph or half cube graph of order n is the graph of the demihypercube, formed by connecting pairs of vertices at distance exactly two from each other in the hypercube graph. This connectivity pattern produces two isomorphic graphs, disconnected from each other, each of which is the halved cube graph.