n, an integer, The number of vertices on each side; there will be 2*n total vertices
Outputs:
G, an object of class Graph (missing documentation), The cocktail party graph
Description
The cocktail party graph with respect to an integer n is a graph with 2*n vertices. Its edge set is formed by taking a disjoint union of n path graphs on 2 vertices and taking its complement, yielding an edge set of every possible edge except for those that were initially adjacent on the ladder.