Cocktail party graph
From Encyclopedia of Mathematics
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
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
How to Cite This Entry:
Cocktail party graph. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Cocktail_party_graph&oldid=53979
Cocktail party graph. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Cocktail_party_graph&oldid=53979