Cocktail party graph

hyperoctahedral graph

A family of graphs $H_s$ formed from the complete graph $K_{2s}$ on $2s$ vertices by removing $s$ disjoint edges: equivalently, the complete multipartite graph $K_{2,2,\ldots,2}$.

References

• Biggs, Norman Algebraic graph theory 2nd ed. Cambridge University Press (1994) ISBN 0-521-45897-8 Zbl 0797.05032