complete_graph (428B)
1 # Complete graph 2 3 A *complete graph* is a [graph] on some set of [vertices] where every possible [edge] exists. When it is found as a [subgraph] or [induced_subgraph] of another [graph], it is called a [clique] 4 5 Complete graphs can be [undirected_graphs], or [directed_graphs]. In the latter case, all [directed_edges] are [bidirectional_edges]; there may or may not be [self_loops] 6 7 Up: [graph_family] 8 9 Aliases: graph complete