networkx.complete_bipartite_graph
networkx.cycle_graph
Enter search terms or a module, class or function name.
Return the circular ladder graph CL_n of length n.
CL_n consists of two concentric n-cycles in which each of the n pairs of concentric nodes are joined by an edge.
Node labels are the integers 0 to n-1