Difference between revisions of "Cocktail party graph"
From Encyclopedia of Mathematics
(Start article: Cocktail party graph) |
m (+ category) |
||
| Line 7: | Line 7: | ||
====References==== | ====References==== | ||
* Biggs, Norman ''Algebraic graph theory'' 2nd ed. Cambridge University Press (1994) ISBN 0-521-45897-8 {{ZBL|0797.05032}} | * Biggs, Norman ''Algebraic graph theory'' 2nd ed. Cambridge University Press (1994) ISBN 0-521-45897-8 {{ZBL|0797.05032}} | ||
| + | [[Category:Graph theory]] | ||
Revision as of 20:09, 15 March 2023
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=52588
Cocktail party graph. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Cocktail_party_graph&oldid=52588