Halved cube graph

The Halved Cube Graph, often denoted as \( Q_n' \), is a specific graph that is derived from the n-dimensional hypercube graph \( Q_n \). The hypercube graph \( Q_n \) consists of vertices representing all binary strings of length \( n \), where two vertices are connected by an edge if their corresponding binary strings differ by exactly one bit.